k-connected graphs without K₄^-.

MaRDI QIDQ2804809zbMATH OpenFDO

Authors Xiang-Jun Li

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

contractible edgecontraction critical \(k\)-connected graph\(K_4^-\)-free graph

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Contractible edges in minimally \(k\)-connected graphs
• Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
• scientific article; zbMATH DE number 1530019
• Contractible edges and triangles in k-connected graphs
• Contractible edges in some \(k\)-connected graphs.

Cited in

(8)

• Contractible edges in minimally \(k\)-connected graphs
• Note on \(k\)-contractible edges in \(k\)-connected graphs
• Graphs in which each \(C_4\) spans \(K_4\)
• Contractible edges of \(k\)-connected graphs for \(k=4,5\).
• A result on quasi \(k\)-connected graphs
• Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
• Connectivity of abelian Cayley graphs containing no K₄
• Graphs without \(K_ 4\) and well-quasi-ordering

This page was built for publication: \(k\)-connected graphs without \(K_4^-\).

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