On \(k\)-critical connected line graphs

DOI10.1006/JCTB.1998.1823zbMath0904.05056OpenAlexW2067635636MaRDI QIDQ1127873

Matthias Kriesell

Publication date: 10 August 1998

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1823

zbMATH Keywords

connectivityline graph\(k\)-critical connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

The symmetric (2k, k)-graphs ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected

Cites Work

• Unnamed Item
• On locally \(k\)-critically \(n\)-connected graphs
• Generalizaions of critical connectivity of graphs
• On multiply critically h-connected graphs
• On k-critical, n-connected graphs
• On k-minimally n-edge-connected graphs
• The interchange graph of a finite graph

This page was built for publication: On \(k\)-critical connected line graphs