Dirac-type characterizations of graphs without long chordless cycles

DOI10.1016/S0012-365X(01)00166-2zbMath1011.05050OpenAlexW2035943952MaRDI QIDQ1849953

Vašek Chvátal, R. Sritharan, Irena Rusu

Publication date: 2 December 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00166-2

zbMATH Keywords

chordless pathsforbidden induced cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (11)

Induced 2-regular subgraphs in \(k\)-chordal cubic graphs ⋮ Vertex decomposable graphs and obstructions to shellability ⋮ Characterizing k-chordal unichord-free graphs ⋮ A Dirac-type characterization of \(k\)-chordal graphs ⋮ Shifting paths to avoidable ones ⋮ Avoidable paths in graphs ⋮ Graph transformations preserving the stability number ⋮ Graph transformations preserving the stability number ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ Avoidable vertices and edges in graphs: existence, characterization, and applications ⋮ Requiring chords in cycles

This page was built for publication: Dirac-type characterizations of graphs without long chordless cycles