Recognizing edge clique graphs among interval graphs and probe interval graphs

DOI10.1016/j.aml.2006.11.004zbMath1152.05364OpenAlexW2004663694MaRDI QIDQ998556

Yaokun Wu, Jing Kong

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.aml.2006.11.004

zbMATH Keywords

interval graphsedge clique graphsprobe interval graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Related Items (1)

Dimension-2 poset competition numbers and dimension-2 poset double competition numbers

Cites Work

• Duality and perfection for edges in cliques
• Edge-clique graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On probe interval graphs
• Linear-time recognition of circular-arc graphs
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Edge clique graphs and some classes of chordal graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing edge clique graphs among interval graphs and probe interval graphs