Treelike comparability graphs

DOI10.1016/j.dam.2008.12.013zbMath1204.05037OpenAlexW1980856085MaRDI QIDQ1026130

Sabine Cornelsen, Gabriele Di Stefano

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.013

zbMATH Keywords

comparability graphssplit decompositiontransitive reductionedge orientationpartition into bounded cliques

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On the Galois Lattice of Bipartite Distance Hereditary Graphs ⋮ Distance-hereditary comparability graphs ⋮ Distance-Hereditary Comparability Graphs ⋮ On the Galois lattice of bipartite distance hereditary graphs

Cites Work

• A linear time algorithm to compute a dominating path in an AT-free graph
• Tolerance graphs
• Completely separable graphs
• Trivially perfect graphs
• On computing the number of linear extensions of a tree
• Track assignment
• Transforming trees by successive local complementations
• A Combinatorial Decomposition Theory
• Decomposition of Directed Graphs
• Graph Classes: A Survey
• Asteroidal Triple-Free Graphs
• On the completeness of a generalized matching problem
• A Note on "The Comparability Graph of a Tree"
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Treelike comparability graphs