There exist highly critically connected graphs of diameter three

DOI10.1007/S00373-006-0672-1zbMath1116.05044OpenAlexW2171038021MaRDI QIDQ882783

Matthias Kriesell

Publication date: 24 May 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0672-1

zbMATH Keywords

Critical connectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Endlichkeitssätze für k-kritische Graphen
• On k-critical, n-connected graphs
• On \(k\)-con-critically \(n\)-connected graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: There exist highly critically connected graphs of diameter three