Recognizing clique graphs of directed edge path graphs
Discrete Applied Mathematics
Intersection graphs of maximal hypercubes
European Journal of Combinatorics
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
The complexity of clique graph recognition
Theoretical Computer Science
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Discrete Applied Mathematics
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
Theoretical Computer Science
Characterization of classical graph classes by weighted clique graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Clique graphs of chordal and path graphs are characterized. A special class of graphs named expanded trees is discussed. It consists of a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Different characterizations of expanded trees are described, leading to a polynomial time algorithm for recognizing them.