Topics in structural graph theory
This book is yet another volume in a series of books edited by Lowell W. Beineke and Robin J. Wilson, which started out more than 40 years ago with three volums of Selected Topics in Graph Theory and Applications of Graph Theory, followed by Graph Connections, Topics in Algebraic Graph theory and Topics in Topological Graph Theory. Just like the preceding volumes, also here the various chapters are written by subject specialists. The point of departure of this volume is Menger's Theorem; and chapter 1 with this title has been written by Ortrud R. Oellermann who also acted as academic consultant for this volume.NEWLINENEWLINEThe volume contains 13 chapters and embraces (just to name some of the chapters) Maximally connected graphs, Minimal connectivity, Contractions of k-connected graphs, Connectivity and cycles, Tree-width and graph minors, Toughness and binding numbers, The phase transition in random graphs. However, the book also deals with algorithms to compute various types of connectivity.NEWLINENEWLINEThis book is not a text book; it rather aims at giving a survey of the state of the art in structural graph theory.
- On the critical densities of minor-closed classes
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- On the \(k\)-component independence number of a tree
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
- A combinatorial characterization of finite groups of prime exponent
- Toughness, binding number and restricted matching extension in a graph
- Path-connectivity of lexicographic product graphs
- Topics in graph automorphisms and reconstruction
- Graphs with large generalized (edge-)connectivity
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Generalized connectivity of some total graphs
- On the embedding of groups and designs in a difference block design
- Graphs defined on groups
- Contractible edges in longest cycles
- Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph
- Efficient augmented block designs for unreplicated test treatments along with replicated controls
- Benchmarking ORCA PT-1 boson sampler in simulation
- On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices
This page was built for publication: Topics in structural graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911581)
