Pages that link to "Item:Q5897573"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897573):
Displaying 14 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)
- 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: A Survey (Q3186100) (← links)
- The Clique-Width of Tree-Power and Leaf-Power Graphs (Q3508556) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- Recognition of linear and star variants of leaf powers is in P (Q6043183) (← links)
- Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i> (Q6075860) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)