Recognizing clique graphs of directed edge path graphs

Authors:
Marisa Gutierrez;João Meidanis
Affiliations:
Departamento de Matemática, Universidad Nacional de La Plata, C. C. 172 (1900) La Plata, Argentina;Instituto de Computação, Universidade Estadual de Campinas, P.O. Box 6176, 13084-971 Campinas, Brazil
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 5
Cited 1

Intersection graphs of paths in a tree

Journal of Combinatorial Theory Series B
Clique graphs and Helly graphs

Journal of Combinatorial Theory Series B
Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Hypergraphs

Handbook of combinatorics (vol. 1)
Recognizing clique graphs of directed and rooted path graphs

Proceedings of the third international conference on Graphs and optimization

Note: Recognizing Helly Edge-Path-Tree graphs and their clique graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these graphs are exactly the two sections of the same kind of path families, and give a polynomial time recognition algorithm for them.