Requiring chords in cycles
From MaRDI portal
Publication:2566156
DOI10.1016/j.disc.2005.04.009zbMath1070.05056MaRDI QIDQ2566156
Publication date: 22 September 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.009
05C38: Paths and cycles
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- On the null-homotopy of bridged graphs
- On simple characterizations of k-trees
- Dirac-type characterizations of graphs without long chordless cycles
- Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Topics in Intersection Graph Theory
- Disjoint clique cutsets in graphs without long holes