The following pages link to (Q4472526):
Displayed 27 items.
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
- Characterising \((k,\ell )\)-leaf powers (Q968117) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Exact leaf powers (Q982668) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
- Pairwise compatibility graphs (Q1032039) (← links)
- The complete inclusion structure of leaf power classes (Q1040592) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Linear time construction of 5-phylogenetic roots for tree chordal graphs (Q2268766) (← links)
- Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
- On pairwise compatibility graphs having Dilworth number two (Q2637346) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← 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)
- Characterizing star-PCGs (Q5916258) (← links)