Mader's conjecture on extremely critical graphs

DOI10.1007/S00493-006-0017-YMaRDI QIDQ858117zbMATH OpenOpenAlexWikidataFDO

Authors Matthias Kriesell

Publication date 8 January 2007

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-006-0017-y

zbMATH Keywords

critical graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Fragments in kcritical n‐connected graphs
• On \(k\)-critical \(2 k\)- connected graphs
• Proof of Mader's conjecture on k‐critical n‐connected graphs
• The symmetric (2k, k)-graphs

Cited in

(6)

• The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
• Proof of Mader's conjecture on k‐critical n‐connected graphs
• Extremal infinite graph theory
• Mader's conjecture for graphs with small connectivity
• Average degree and contractibility
• scientific article; zbMATH DE number 4183446 (Why is no real title available?)

This page was built for publication: Mader's conjecture on extremely critical graphs

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