找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Exercises in Graph Theory; O. Melnikov,V. Sarvanov,I. Zverovich Textbook 1998 Springer Science+Business Media B.V., part of Springer Natur

[复制链接]
查看: 41038|回复: 45
发表于 2025-3-21 18:43:52 | 显示全部楼层 |阅读模式
书目名称Exercises in Graph Theory
编辑O. Melnikov,V. Sarvanov,I. Zverovich
视频video
丛书名称Texts in the Mathematical Sciences
图书封面Titlebook: Exercises in Graph Theory;  O. Melnikov,V. Sarvanov,I. Zverovich Textbook 1998 Springer Science+Business Media B.V., part of Springer Natur
描述This book supplements the textbook of the authors" Lectures on Graph The­ ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord­ ing to the topics of graph theory: paths, cycles, components, subgraphs, re­ constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find
出版日期Textbook 1998
关键词Graph theory; Hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; graphs; optimiza
版次1
doihttps://doi.org/10.1007/978-94-017-1514-0
isbn_softcover978-90-481-4979-7
isbn_ebook978-94-017-1514-0Series ISSN 0927-4529
issn_series 0927-4529
copyrightSpringer Science+Business Media B.V., part of Springer Nature 1998
The information of publication is updating

书目名称Exercises in Graph Theory影响因子(影响力)




书目名称Exercises in Graph Theory影响因子(影响力)学科排名




书目名称Exercises in Graph Theory网络公开度




书目名称Exercises in Graph Theory网络公开度学科排名




书目名称Exercises in Graph Theory被引频次




书目名称Exercises in Graph Theory被引频次学科排名




书目名称Exercises in Graph Theory年度引用




书目名称Exercises in Graph Theory年度引用学科排名




书目名称Exercises in Graph Theory读者反馈




书目名称Exercises in Graph Theory读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:57:10 | 显示全部楼层
Exercises in Graph Theory978-94-017-1514-0Series ISSN 0927-4529
发表于 2025-3-22 00:46:50 | 显示全部楼层
发表于 2025-3-22 07:50:11 | 显示全部楼层
Being An Academic In A Time-Impoverished Ageh each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs.
发表于 2025-3-22 10:05:49 | 显示全部楼层
,“BEFORE PHILOSOPHY”: ANCIENT MESOPOTAMIA,raph, and the elements of . are called its .. The sets of vertices and arcs of a digraph . are denoted by . and . respectively. The number |.| is called the . and is also denoted by |.|. If |.| = . and |.| = . then . is said to be an (.)-digraph.
发表于 2025-3-22 16:02:32 | 显示全部楼层
发表于 2025-3-22 19:33:20 | 显示全部楼层
发表于 2025-3-22 21:26:05 | 显示全部楼层
Being An Academic In A Time-Impoverished Ageh each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs.
发表于 2025-3-23 02:53:40 | 显示全部楼层
,“BEFORE PHILOSOPHY”: ANCIENT MESOPOTAMIA,raph, and the elements of . are called its .. The sets of vertices and arcs of a digraph . are denoted by . and . respectively. The number |.| is called the . and is also denoted by |.|. If |.| = . and |.| = . then . is said to be an (.)-digraph.
发表于 2025-3-23 07:16:19 | 显示全部楼层
https://doi.org/10.1007/978-94-017-1514-0Graph theory; Hypergraph; Matching; Matchings; Mathematica; VLSI; combinatorics; complexity; graphs; optimiza
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-5 19:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表