Pages that link to "Item:Q965972"
From MaRDI portal
The following pages link to Rooted directed path graphs are leaf powers (Q965972):
Displaying 15 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS (Q2846475) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
- Computing optimal leaf roots of chordal cographs in linear time (Q6616231) (← links)
