Graph minors and minimum degree
From MaRDI portal
Abstract: Let be the class of graphs for which every minor has minimum degree at most . Then is closed under taking minors. By the Robertson-Seymour graph minor theorem, is characterised by a finite family of minor-minimal forbidden graphs, which we denote by . This paper discusses and related topics. We obtain four main results: We prove that every -regular graph with less than vertices is in , and this bound is best possible. We characterise the graphs in that can be obtained from a graph in by adding one new vertex. For every graph in is -connected, but for large , we exhibit graphs in with connectivity 1. In fact, we construct graphs in with arbitrary block structure. We characterise the complete multipartite graphs in , and prove analogous characterisations with minimum degree replaced by connectivity, treewidth, or pathwidth.
Recommendations
Cited in
(7)- Minimum degree and graph minors
- Graph minor theory
- Minimum gradation in greyscales of graphs
- Minimum degree condition for a graph to be knitted
- Graph minors. XII: Distance on a surface
- scientific article; zbMATH DE number 5525873 (Why is no real title available?)
- scientific article; zbMATH DE number 4144031 (Why is no real title available?)
This page was built for publication: Graph minors and minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612934)