On the Structure of Contractible Vertex Pairs in Chordal Graphs

DOI10.1016/j.endm.2009.03.005zbMath1267.05220OpenAlexW1982639160MaRDI QIDQ2839231

N. Sadagopan, N. S. Narayanaswamy

Publication date: 4 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.005

zbMATH Keywords

connectivity\(k\)-trees and chordal graphscontractible non-edges

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (2)

Some results on connected vertex separators ⋮ Connectivity of the graph induced by contractible edges of a \(k\)-tree

Cites Work

• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Enumeration of \(K\)-trees and applications
• Contractible non-edges in \(3\)-connected graphs
• Contractible non-edges in triangle-free graphs
• Triangulated graphs and the elimination process

This page was built for publication: On the Structure of Contractible Vertex Pairs in Chordal Graphs