Cover-incomparability graphs and chordal graphs

DOI10.1016/J.DAM.2010.07.001zbMath1208.05105OpenAlexW2001975611MaRDI QIDQ602752

Antony Mathews, Tanja Gologranc, Manoj Changat, Boštjan Brešar, Joseph Mathews

Publication date: 5 November 2010

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

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

zbMATH Keywords

posetchordal graphblock graphunderlying graphSplit graph

Mathematics Subject Classification ID

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

Related Items (8)

Ptolemaic and chordal cover-incomparability graphs ⋮ Composition and product of cover-incomparability graphs ⋮ Ptolemaic and planar cover-incomparability graphs ⋮ Comparability graphs among cover-incomparability graphs ⋮ Which \(k\)-trees are cover-incomparability graphs? ⋮ Which distance-hereditary graphs are cover-incomparability graphs? ⋮ Characterizing subclasses of cover-incomparability graphs by forbidden subposets ⋮ Cographs which are cover-incomparability graphs of posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of cover-incomparability graphs of posets
• Cover-incomparability graphs of posets
• The induced path convexity, betweenness, and svelte graphs
• Convexities related to path properties on graphs
• Partitioning chordal graphs into independent sets and cliques
• Induced path transit function, monotone and Peano axioms
• The All-Paths Transit Function of a Graph
• Graph Classes: A Survey

This page was built for publication: Cover-incomparability graphs and chordal graphs