The following pages link to Some remarks about leaf roots (Q2497485):
Displayed 24 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Exact leaf powers (Q982668) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers (Q1043551) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- Pairwise compatibility graphs: complete characterization for wheels (Q2424298) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- Cycle Extendability of Hamiltonian Strongly Chordal Graphs (Q4959662) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- (Q5089163) (← links)
- Ptolemaic Graphs and Interval Graphs Are Leaf Powers (Q5458553) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- On k- Versus (k + 1)-Leaf Powers (Q5505655) (← links)
- A polynomial kernel for 3-leaf power deletion (Q6046945) (← links)
- Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i> (Q6075860) (← links)