Corpus ID: 10655711

Path Graphs, Clique Trees, and Flowers

@article{Mouatadid2015PathGC,
  title={Path Graphs, Clique Trees, and Flowers},
  author={Lalla Mouatadid and Robert Robere},
  journal={ArXiv},
  year={2015},
  volume={abs/1505.07702}
}
  • Lalla Mouatadid, Robert Robere
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • An \emph{asteroidal triple} is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the third. A classical result by Lekkerkerker and Boland \cite{6} showed that interval graphs are precisely the chordal graphs that do not have asteroidal triples. Interval graphs are chordal, as are the \emph{directed path graphs} and the \emph{path graphs}. Similar to Lekkerkerker and Boland, Cameron, Ho\'{a}ng, and L… CONTINUE READING

    References

    SHOWING 1-10 OF 18 REFERENCES
    Characterizing directed path graphs by forbidden asteroids
    • 6
    • Highly Influential
    • PDF
    Intersection graphs of paths in a tree
    • C. Monma, V. Wei
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 1986
    • 118
    A Faster Algorithm to Recognize Undirected Path Graphs
    • A. Schäffer
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1993
    • 21
    • PDF
    A recognition algorithm for the intersection graphs of paths in trees
    • F. Gavril
    • Mathematics, Computer Science
    • Discret. Math.
    • 1978
    • 94
    The LBFS Structure and Recognition of Interval Graphs
    • 97
    • PDF
    The forbidden subgraph characterization of directed vertex graphs
    • 6
    • Highly Influential
    • PDF
    The forbidden subgraph characterization of directed vertex graphs
    • 18
    • Highly Influential
    Characterizing path graphs by forbidden induced subgraphs
    • 20
    • Highly Influential
    • PDF
    Paths, Trees, and Flowers
    • 2,155
    • PDF