Distances in cocomparability graphs and their powers

DOI10.1016/0166-218X(92)90296-MzbMath0747.05075MaRDI QIDQ1183347

Peter Damaschke

Publication date: 28 June 1992

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

zbMATH Keywords

distancescocomparability graphsinterval graphspowers

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (9)

Powers of distance-hereditary graphs ⋮ On powers of \(m\)-trapezoid graphs ⋮ Injective hulls of various graph classes ⋮ Duchet-type theorems for powers of HHD-free graphs ⋮ On powers of circular arc graphs and proper circular arc graphs ⋮ Powers of geometric intersection graphs and dispersion algorithms ⋮ Approximating the path-distance-width for AT-free graphs and graphs in related classes ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ Algorithms and complexity of \(s\)-club cluster vertex deletion

Cites Work

• Topics on perfect graphs
• On powers and centers of chordal graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distances in cocomparability graphs and their powers