Asteroids in rooted and directed path graphs

DOI10.1016/j.endm.2009.02.010zbMath1267.05174OpenAlexW1662713141MaRDI QIDQ2839213

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

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.010

zbMATH Keywords

intersection graphchordal graphinterval graphasteroidal triplestrong pathdirected path graphstrong asteroidal triple

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

On models of directed path graphs non rooted directed path graphs ⋮ Characterizing directed path graphs by forbidden asteroids ⋮ Asteroidal quadruples in non rooted path graphs ⋮ Two new characterizations of path graphs ⋮ On the model-checking of monadic second-order formulas with edge set quantifications

Cites Work

• The forbidden subgraph characterization of directed vertex graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Characterizing path graphs by forbidden induced subgraphs

This page was built for publication: Asteroids in rooted and directed path graphs