On rooted packings, decompositions, and factors of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3974987 (Why is no real title available?)
- scientific article; zbMATH DE number 3710196 (Why is no real title available?)
- scientific article; zbMATH DE number 398969 (Why is no real title available?)
- scientific article; zbMATH DE number 1334640 (Why is no real title available?)
- scientific article; zbMATH DE number 845482 (Why is no real title available?)
- 3K2-decomposition of a graph
- A Characterization in of Upper-Embeddable Graphs
- A note on the decomposition of graphs into isomorphic matchings
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Graph theory
- NP-completeness of graph decomposition problems
- On the Complexity of General Graph Factor Problems
- Perfect path double covers of graphs
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- The NP-Completeness of Some Edge-Partition Problems
Cited in
(3)
This page was built for publication: On rooted packings, decompositions, and factors of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418772)