On determination and construction of critically 2-connected graphs

MaRDI QIDQ547536zbMATH OpenFDO

Authors Y. M. Borse, B. N. Waphare

Publication date 4 July 2011

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\({\mathcal G}\)-seriesalmost criticalcritically 2-connectedremovable earseries-parallel graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3950569
• On critical 3-connected graphs with two vertices of degree 3. II
• scientific article; zbMATH DE number 3916310
• On critical 3-connected graphs with two vertices of degree 3. I
• scientific article; zbMATH DE number 3916304

Cited in

(6)

• Reducible chains in several types of 2-connected graphs
• Cameron's construction of two-graphs
• 2.5-connectivity: unique components, critical graphs, and applications
• scientific article; zbMATH DE number 3916310 (Why is no real title available?)
• scientific article; zbMATH DE number 3950569 (Why is no real title available?)
• On \(k\)-critical \(2 k\)- connected graphs

This page was built for publication: On determination and construction of critically 2-connected graphs

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