Connectivity of graphs with given girth pair

DOI10.1016/J.DISC.2006.06.024zbMath1109.05060OpenAlexW2007769690MaRDI QIDQ864156

A. Diánez, Xavier Marcote, Pedro García-Vázquez, Martín Cera, Camino Balbuena

Publication date: 13 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.024

zbMATH Keywords

line graph

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (6)

Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ On local connectivity of graphs with given clique number ⋮ On the connectivity of \(p\)-diamond-free graphs ⋮ On the Superconnectivity in graphs with odd girth g and even girth h

Cites Work

• Sufficient conditions for maximally connected dense graphs
• On the order and size of \(s\)-geodetic digraphs with given connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• Regular graphs with given girth pair
• Maximally connected digraphs
• Unnamed Item

This page was built for publication: Connectivity of graphs with given girth pair