The forbidden subgraph characterization of directed vertex graphs
From MaRDI portal
Publication:1297413
DOI10.1016/S0012-365X(98)00127-7zbMATH Open0928.05029WikidataQ127976741 ScholiaQ127976741MaRDI QIDQ1297413FDOQ1297413
Authors: B. S. Panda 
Publication date: 9 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
digraphscharacterizationintersection graphforbidden subgraphsdirected path graphdirected vertex graph
Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Intersection graphs of paths in a tree
- Incidence matrices and interval graphs
- On rigid circuit 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
- Representations of chordal graphs as subtrees of a tree
- Triangulated graphs and the elimination process
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- A characterisation of rigid circuit graphs
- Topics on perfect graphs
- A faster algorithm to recognize undirected path graphs
- Intersection graphs of vertex disjoint paths in a tree
- Intersection representations of graphs by arcs
Cited In (12)
- On models of directed path graphs non rooted directed path graphs
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- Two new characterizations of path graphs
- Asteroidal quadruples in non rooted path graphs
- Intersection graphs of non-crossing paths
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- From path graphs to directed path graphs
- Characterizing width two for variants of treewidth
- Line graphs of directed graphs. I.
- Characterizing path graphs by forbidden induced subgraphs
- Asteroids in rooted and directed path graphs
- Characterizing directed path graphs by forbidden asteroids
This page was built for publication: The forbidden subgraph characterization of directed vertex graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297413)
