A Dirac-type characterization of \(k\)-chordal graphs

DOI10.1016/j.disc.2013.08.032zbMath1281.05082arXiv1206.5397OpenAlexW2122599841MaRDI QIDQ394280

N. Sadagopan, N. S. Narayanaswamy, Rogers Mathew, R. Krithika

Publication date: 27 January 2014

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

Full work available at URL: https://arxiv.org/abs/1206.5397

zbMATH Keywords

characterizationsimplicial vertex\(k\)-chordal graphssimplicial ordering

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (9)

Induced 2-regular subgraphs in \(k\)-chordal cubic graphs ⋮ Characterizing k-chordal unichord-free graphs ⋮ Fuzzy chordal graphs and its properties ⋮ Some results on connected vertex separators ⋮ Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs ⋮ Unnamed Item ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Generalized chordality, vertex separators and hyperbolicity on graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Finding large holes
• Treewidth for graphs with small chordality
• Dirac-type characterizations of graphs without long chordless cycles
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs

This page was built for publication: A Dirac-type characterization of \(k\)-chordal graphs