A characterization of some graph classes with no long holes

DOI10.1006/jctb.1995.1048zbMath0842.05074OpenAlexW2040005901MaRDI QIDQ1898735

Elaine M. Eschen, R. Sritharan

Publication date: 28 July 1996

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

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

zbMATH Keywords

holespathendpointschordal bipartite graphstriangulated graphchordless pathantiholesseparable edgessimplicial vertices

Mathematics Subject Classification ID

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

Related Items (4)

Meyniel weakly triangulated graphs. II: A theorem of Dirac ⋮ A new characterization of HH-free graphs ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Maximum weight independent sets in hole- and co-chair-free graphs

This page was built for publication: A characterization of some graph classes with no long holes