Pages that link to "Item:Q4376161"
From MaRDI portal
The following pages link to Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161):
Displaying 17 items.
- <i>P</i><sub>4</sub><i>-</i>Decomposition of Total Graphs (Q5069657) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)
- Minimalist designs (Q5120741) (← links)
- PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS (Q5237541) (← links)
- Star decomposition of graphs (Q5261050) (← links)
- Decomposing Graphs of High Minimum Degree into 4‐Cycles (Q5265328) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Monochromatic <i>K<sub>r</sub></i>‐Decompositions of Graphs (Q5418770) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)