Open AccessBook
Graph Theory
Reads0
Chats0
TLDR
Gaph Teory Fourth Edition is standard textbook of modern graph theory which covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each chapter by one or two deeper results.Abstract:
Gaph Teory Fourth Edition Th is standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each fi eld by one or two deeper results, again with proofs given in full detail.read more
Citations
More filters
Journal ArticleDOI
Mixing 3-colourings in bipartite graphs
TL;DR: It is shown that the 3-colour graph of a 3-chromatic graph is never connected, and that restricted to planar bipartite graphs, the question is answerable in polynomial time.
Journal ArticleDOI
An approximate approach for the joint problem of level of repair analysis and spare parts stocking
TL;DR: In this paper, an iterative algorithm is proposed to solve the problem of spare parts stocking in the context of the level of repair analysis (lora), where the lora does not consider the availability of the installed base, leading to suboptimal solutions.
Proceedings ArticleDOI
On the controlled agreement problem
Amir Rahmani,Mehran Mesbahi +1 more
TL;DR: This work considers the controlled agreement problem and introduces algebraic and graph theoretic conditions for its controllability, and provides a graphical interpretation of these controllable conditions.
Proceedings ArticleDOI
Fixed-point logics on planar graphs
TL;DR: The following results are proved: (1) IFP captures polynomial time on 3-connected planar graphs, and IFP+C capturesPolynomialTime on arbitraryPlanar graphs can be characterized up to isomorphism in a logic with finitely many variables and counting.
Journal ArticleDOI
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
TL;DR: It is shown that in any edge-colouring of a complete graph with three colours, it is possible to cover all the vertices with three vertex-disjoint monochromatic paths, proving a particular case of a conjecture due to Gyarfas.
Related Papers (5)
Graduate Texts in Mathematics
Rajendra Bhatia,Glen Bredon,Wolfgang Walter,Joseph J. Rotman,M. Ram Murty,Jane Gilman,Peter Walters,Martin Golubitsky,Ioannis Karatzas,Henri Cohen,Raoul Bott,Gaisi Takeuti,Béla Bollobás,John M. Lee,Jiří Matoušek,Saunders Mac Lane,John L. Kelley,B. A. Dubrovin,Tom M. Apostol,John Stillwell,William Arveson +20 more