Graph theory.
From MaRDI portal
This book is a concise introduction to modern graph theory covering all its topics in the following chapters: The basics. Matching. Connectivity. Planar graphs. Colouring. Flows. Substructures in dense graphs. Substructures in sparse graphs. Ramsey theory for graphs. Hamilton cycles. Random graphs. Minors, trees, and well-quasi-ordering. The symbols and terms defined are listed in the margin; these margins also contain reference numbers of those results that are used in the proofs. This second edition extends the first in two major changes. The last chapter now gives a complete proof of one of the major results of the Robertson-Seymour theory. The second major change is the addition of a complete set of hints for the exercises, 250 in all. Apart from these two changes, there are a few additions. Among others a new proof of Menger's theorem. The book has every chance of becoming a standard textbook of contemporary graph theory.
Recommendations
Cited in
(only showing first 100 items - show all)- Nodal domains and spectral minimal partitions
- On k-connectivity problems with sharpened triangle inequality
- A clique-difference encoding scheme for labelled \(k\)-path graphs
- Spectral structure of the Laplacian on a covering graph
- Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
- A polynomial-time algorithm to find a linkless embedding of a graph
- A complex network approach to text summarization
- The equitable dispersion problem
- Bounds on isoperimetric values of trees
- On the OBDD size for graphs of bounded tree- and clique-width
- Hadwiger number and the Cartesian product of graphs
- Minimum entropy coloring
- Covering graphs with few complete bipartite subgraphs
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Hadwiger's conjecture for proper circular arc graphs
- On tree-partition-width
- Critically loaded queueing models that are throughput suboptimal
- Independence polynomials of circulants with an application to music
- Connected domination of regular graphs
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s
- Linear connectivity forces large complete bipartite minors
- A note on acyclic edge coloring of complete bipartite graphs
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
- Weighted degrees and heavy cycles in weighted graphs
- On immersions of uncountable graphs
- Graphs whose positive semi-definite matrices have nullity at most two
- Obstructions to a small hyperbolicity in Helly graphs
- Computation of contour integrals on \( \mathcal{M}_{0,n} \)
- \(\Lambda\) scattering equations
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- The Tutte polynomial of an infinite family of outerplanar, small-world and self-similar graphs
- On the number of spanning trees in graphs with multiple edges
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Structured proportional representation
- Null decomposition of trees
- CHY loop integrands from holomorphic forms
- Size-treewidth tradeoffs for circuits computing the element distinctness function
- Solving problems on graphs of high rank-width
- On the core-nilpotent decomposition of trees
- Maximum likelihood threshold and generic completion rank of graphs
- Optimal selection of essential interconnections for structural controllability in heterogeneous subsystems
- Characterizing and recognizing 4-map graphs
- Min-max cover of a graph with a small number of parts
- Topological graph description of multicellular dynamics based on vertex model
- Uniquely pressable graphs: characterization, enumeration, and recognition
- Some deterministic and random fixed point theorems on a graph
- A folk theorem for repeated games played on a network
- Graph minor hierarchies
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- The biorder polytope
- The incidence coloring conjecture for graphs of maximum degree 3
- Planar minimally rigid graphs and pseudo-triangulations
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- Generalizations of matched CNF formulas
- Ramsey degrees of bipartite graphs: a primitive recursive proof
- On Eulerian and regular perfect path double covers of graphs
- Batched bin packing
- The k-regular induced subgraph problem
- Colouring of cubic graphs by Steiner triple systems
- Graphs with magnetic Schrödinger operators of low corank
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Finding paths in graphs avoiding forbidden transitions
- A revival of the girth conjecture
- On short cycles through prescribed vertices of a graph
- On paths and cycles through specified vertices
- Topological paths, cycles and spanning trees in infinite graphs
- Formal molecular biology
- Dynamic of cyclic automata over \(\mathbb Z^2\)
- Rooted minor problems in highly connected graphs
- Hajós' theorem for list coloring
- An existential locality theorem
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
- Investigation of preparation up to six and \(N\)-atom graph states
- Ranking hubs and authorities using matrix functions
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- Preferences over consumption and status
- Finding the edge ranking number through vertex partitions
- Associated primes of powers of edge ideals
- Structural properties and hamiltonicity of neighborhood graphs
- Perfect unit graphs of commutative Artinian rings
- A flow network analysis of direct balance-sheet contagion in financial networks
- Efficient entanglement measure for graph states
- On the relationships between zero forcing numbers and certain graph coverings
- Signed graphs with stable maximum nullity at most two
- Mixed partition functions and exponentially bounded edge-connection rank
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Compact distributed certification of planar graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Weighting by iteration: iterations of \(n\) variables means based on subdivisions of the standard \((n-1)\)-simplex
- Covering projective planar graphs with three forests
- Barabasi-Albert trees are hypoenergetic
- On the grey obligation rules
- On the maxima of Motzkin-Straus programs and cliques of graphs
- Refined finiteness and degree properties in graphs
- About graph unions and intersections
- Unmixedness of some weighted oriented graphs
- Inference on the structure of gene regulatory networks
- Spectral preorder and perturbations of discrete weighted graphs
This page was built for publication: Graph theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4947393)
