Characterizing directed path graphs by forbidden asteroids

DOI10.1002/jgt.20543zbMath1230.05139OpenAlexW2101313002MaRDI QIDQ3174239

Benjamin Lévêque, Kathie Cameron, Chính T. Hoàng

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20543

zbMATH Keywords

intersection graphasteroidal tripledirected path graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On models of directed path graphs non rooted directed path graphs ⋮ Asteroidal quadruples in non rooted path graphs ⋮ Two new characterizations of path graphs

Cites Work

• Unnamed Item
• Some remarks on interval graphs
• Intersection graphs of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• The forbidden subgraph characterization of directed vertex graphs
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Asteroids in rooted and directed path graphs
• Representation of a finite graph by a set of intervals on the real line
• Characterizing path graphs by forbidden induced subgraphs
• The leafage of a chordal graph
• Topics in Intersection Graph Theory
• Graph Classes: A Survey

This page was built for publication: Characterizing directed path graphs by forbidden asteroids