On maximum critically h-connected graphs

DOI10.1016/0012-365X(84)90083-9zbMATH Open0553.05049OpenAlexW2019198093MaRDI QIDQ801933FDOQ801933

Henk Jan Veldman, H. J. Krol

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90083-9

Recommendations

• scientific article; zbMATH DE number 5116525
• scientific article
• scientific article; zbMATH DE number 11392
• On criticality of critically \(h\)-edge-connected graphs
• Maximam critical n-edge connected graph
• scientific article; zbMATH DE number 3950570
• Characteristics of maximum critically \(h\)-connected graphs of order \(n\) when \(h\geq n/2\)
• scientific article; zbMATH DE number 11398
• scientific article
• scientific article; zbMATH DE number 568837

zbMATH Keywords

degreecritical connected graphs

Mathematics Subject Classification ID

Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites Work

• Parallel concepts in graph theory
• Non-\(\kappa\)-critical vertices in graphs
• Characterization of maximum critically 2-connected graphs
• On maximum critically h-connected graphs

Cited In (14)

• On Minimum Critically n-Edge-Connected Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Haj�s constructions of critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On maximum critically h-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum size of graphs satisfying a degree condition

This page was built for publication: On maximum critically h-connected graphs

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