Recognizing edge clique graphs among interval graphs and probe interval graphs
type: Item
instance of: scholarly article
title: Recognizing edge clique graphs among interval graphs and probe interval graphs
zbMATH Open document ID: 1152.05364
author: Jing Kong
author: Yaokun Wu
published in: Applied Mathematics Letters
publication date: 2009-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C17
zbMATH DE Number: 5499942
zbMATH Keywords: edge clique graphs
zbMATH Keywords: interval graphs
zbMATH Keywords: probe interval graphs
MaRDI profile type: Publication
full work available at URL: j.aml.2006.11.004
OpenAlex ID: W2004663694
cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs
cites work: Duality and perfection for edges in cliques
cites work: Q5708531
cites work: Q5461446
cites work: Edge clique graphs and some classes of chordal graphs
cites work: Edge-clique graphs
cites work: Q3575460
cites work: Q3976632
cites work: Q4867717
cites work: Q3820643
cites work: Q4000791
cites work: Algorithmic graph theory and perfect graphs
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: A polynomial time recognition algorithm for probe interval graphs
cites work: Q3428192
cites work: On probe interval graphs
cites work: Linear-time recognition of circular-arc graphs
cites work: Q4829024
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Incidence matrices and interval graphs
DOI: 10.1016/J.AML.2006.11.004
description: scientific article; zbMATH DE number 5499942