Treelike comparability graphs
type: Item
instance of: scholarly article
title: Treelike comparability graphs
zbMATH Open document ID: 1204.05037
author: Sabine Cornelsen
author: Gabriele Di Stefano
published in: Discrete Applied Mathematics
publication date: 2009-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5569457
zbMATH Keywords: comparability graphs
zbMATH Keywords: edge orientation
zbMATH Keywords: transitive reduction
zbMATH Keywords: split decomposition
zbMATH Keywords: partition into bounded cliques
MaRDI profile type: Publication
full work available at URL: j.dam.2008.12.013
OpenAlex ID: W1980856085
cites work: On computing the number of linear extensions of a tree
cites work: Q4260373
cites work: Transforming trees by successive local complementations
cites work: Graph Classes: A Survey
cites work: Introduction to algorithms
cites work: Asteroidal Triple-Free Graphs
cites work: A linear time algorithm to compute a dominating path in an AT-free graph
cites work: Track assignment
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A Combinatorial Decomposition Theory
cites work: Decomposition of Directed Graphs
cites work: Q4470503
cites work: A graph theoretical approach to the shunting problem
cites work: Q5708495
cites work: Trivially perfect graphs
cites work: Tolerance graphs
cites work: Q4232775
cites work: Completely separable graphs
cites work: On the completeness of a generalized matching problem
cites work: Q4694722
cites work: A Note on "The Comparability Graph of a Tree"
DOI: 10.1016/J.DAM.2008.12.013
description: scientific article; zbMATH DE number 5569457