On models of directed path graphs non rooted directed path graphs

DOI10.1007/S00373-015-1600-ZzbMath1339.05160OpenAlexW2187104243MaRDI QIDQ292267

Marisa Gutierrez, Silvia B. Tondato

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11336/54360

zbMATH Keywords

clique treesasteroidal quadruplesrooted directed path graphs

Mathematics Subject Classification ID

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

Related Items (1)

Two new characterizations of path graphs

Cites Work

• Unnamed Item
• Asteroidal quadruples in non rooted path graphs
• Intersection graphs of paths in a tree
• The forbidden subgraph characterization of directed vertex graphs
• The vertex leafage of chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Asteroids in rooted and directed path graphs
• From Path Graphs to Directed Path Graphs
• Characterizing directed path graphs by forbidden asteroids
• 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

This page was built for publication: On models of directed path graphs non rooted directed path graphs