Symmetric graph-theoretic roles of two-pairs and chords of cycles

DOI10.1142/S1793830914500311zbMATH Open1298.05275MaRDI QIDQ2920879FDOQ2920879

Authors: Terry A. McKee 

Publication date: 29 September 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Recommendations

• New graph classes characterized by weak vertex separators and two-pairs
• Constrained chords in strongly chordal and distance-hereditary graphs
• A characterization of strongly chordal graphs
• An efficient algorithm for finding a two-pair, and its applications
• Strengthening strongly chordal graphs

zbMATH Keywords

chordal graphstrongly chordal graphdistance-hereditary graphweakly chordal graphtwo-pair

Mathematics Subject Classification ID

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

Cites Work

• Topics in Intersection Graph Theory
• Graph Classes: A Survey
• Characterizations of strongly chordal graphs
• Distance-hereditary graphs
• Weakly triangulated graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Algorithms for weakly triangulated graphs
• Maximal sub-triangulation in pre-processing phylogenetic data
• A new characterization of HH-free graphs

Cited In (4)

• Characterizing graph classes using twin vertices of regular induced subgraphs
• Symmetries and drawings of sets of cycles and chromatic automorphisms
• New graph classes characterized by weak vertex separators and two-pairs
• The symmetric (2k, k)-graphs

This page was built for publication: Symmetric graph-theoretic roles of two-pairs and chords of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920879)