Pages that link to "Item:Q2367409"
From MaRDI portal
The following pages link to A faster algorithm to recognize undirected path graphs (Q2367409):
Displaying 13 items.
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217) (← links)
- From Path Graphs to Directed Path Graphs (Q3057630) (← links)
- Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Two new characterizations of path graphs (Q6056699) (← links)
- Recognising the overlap graphs of subtrees of restricted trees is hard (Q6621196) (← links)
