On minors of graphs with at least 3n −4 edges

DOI10.1002/JGT.3190170409MaRDI QIDQ3137768zbMATH OpenOpenAlexFDO

Authors

Publication date 13 October 1993

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190170409

zbMATH Keywords

minimum degreeconnected graphminorseparator

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Minors of quasi 4-connected graphs
• Excluding minors in nonplanar graphs of girth at least five
• The structure of quasi 4-connected graphs
• Minors in large almost-5-connected non-planar graphs
• A result on quasi \(k\)-connected graphs

Cited in

(12)

• Minors of quasi 4-connected graphs
• Framed 4-valent graph minor theory II: Special minors and new examples
• Minimum number of vertices of almost 3-regular graphs with given deficiency
• The structure of quasi 4-connected graphs
• A chain theorem for \(3^+\)-connected graphs
• A note on minimum graphs with girth pair (4, 2l + 1)
• Excluding minors in nonplanar graphs of girth at least five
• On the minor-minimal 2-connected graphs having a fixed minor
• Four problems on graphs with excluded minors
• scientific article; zbMATH DE number 975388 (Why is no real title available?)
• Minimally 4-edge\(^ \#\)-connected graphs
• Extremal results for rooted minor problems

This page was built for publication: On minors of graphs with at least 3n −4 edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137768)