Characterizations of treelike comparability graphs

MaRDI QIDQ3429490zbMATH OpenFDO

Authors M. Gutierrez, M. P. Dobson, Jayme L. Szwarcfiter

Publication date 2 April 2007

zbMATH Keywords

characterizationsposetperfect graphsforbidden configurationacycle orientationtreelike graphstreelike poset

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Treelike comparability graphs
• scientific article; zbMATH DE number 434480
• Cycle-free partial orders and chordal comparability graphs
• scientific article; zbMATH DE number 1554932

Cited in

(10)

• Comparing classification tree structures: a special case of comparing q-ary relations
• Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
• Treewidth of cocomparability graphs and a new order-theoretic parameter
• Treelike comparability graphs
• Tree-width and path-width of comparability graphs of interval orders
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• Comparing trees characteristic to chordal and dually chordal graphs
• scientific article; zbMATH DE number 6493054 (Why is no real title available?)
• A generalization of hierarchical exchangeability on trees to directed acyclic graphs

This page was built for publication: Characterizations of treelike comparability graphs

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