Characterization of maximum critically 2-connected graphs

DOI10.1002/JGT.3190020406zbMATH Open0406.05042OpenAlexW2084581272MaRDI QIDQ4192096FDOQ4192096

Authors: R. C. Entringer 

Publication date: 1978

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

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

Mathematics Subject Classification ID

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

Cited In (3)

• On Minimum Critically n-Edge-Connected Graphs
• Computer based proofs by induction in graph theory - A house of cards?
• On maximum critically h-connected graphs

This page was built for publication: Characterization of maximum critically 2-connected graphs

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