Pages that link to "Item:Q1024436"
From MaRDI portal
The following pages link to Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436):
Displaying 13 items.
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Solving a special case of the P conjecture using dependency graphs with dissolution (Q1749169) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Graphs having the local decomposition property (Q2760991) (← links)
- Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644) (← links)
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161) (← links)
- Induced Decompositions of Graphs (Q4916103) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)