Pages that link to "Item:Q1179032"
From MaRDI portal
The following pages link to NP-completeness of graph decomposition problems (Q1179032):
Displaying 35 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- 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)
- Trahtenbrot-Zykov problem and NP-completeness (Q1201257) (← links)
- Graph decomposition of slim graphs (Q1288512) (← 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)
- Algorithmic problems in right-angled Artin groups: complexity and applications (Q1628497) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← 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)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- Graphs having the local decomposition property (Q2760991) (← links)
- (Q3826607) (← links)
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161) (← links)
- (Q4489161) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
- Clique and anticlique partitions of graphs (Q6550534) (← links)