The following pages link to The 3-Steiner Root Problem (Q3508559):
Displayed 18 items.
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Simplicial powers of graphs (Q1040586) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- Maximal determinants of combinatorial matrices (Q1641998) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← 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)
- Recognition of linear and star variants of leaf powers is in P (Q6043183) (← 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)