Symmetric graph-theoretic roles of two-pairs and chords of cycles
From MaRDI portal
Publication:2920879
DOI10.1142/S1793830914500311zbMath1298.05275MaRDI QIDQ2920879
Publication date: 29 September 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Weakly triangulated graphs
- A new characterization of HH-free graphs
- Characterizations of strongly chordal graphs
- Distance-hereditary graphs
- Algorithms for weakly triangulated graphs
- Maximal sub-triangulation in pre-processing phylogenetic data
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
This page was built for publication: Symmetric graph-theoretic roles of two-pairs and chords of cycles