Pages that link to "Item:Q1179032"
From MaRDI portal
The following pages link to NP-completeness of graph decomposition problems (Q1179032):
Displayed 16 items.
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- Decomposition of large combinatorial structures (Q1107544) (← links)
- A Helly property of arcs (Q1109340) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Delta-system decompositions of graphs (Q1356709) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Clique and anticlique partitions of graphs (Q1584251) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)