Pages that link to "Item:Q3837386"
From MaRDI portal
The following pages link to The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs (Q3837386):
Displaying 18 items.
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Homomorphisms to oriented paths (Q1336655) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs (Q1765527) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- The isomorphism problem for rose window graphs (Q2439119) (← links)
- Isomorphism for digraphs and sequences of shop scheduling problems (Q2744381) (← links)
- (Q3335823) (← links)
- Isomorphisms and traversability of directed path graphs (Q4435558) (← links)
- (Q5089162) (← links)
- Isometric copies of directed trees in orientations of graphs (Q5110684) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
