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 50 items.
- Path decompositions of regular graphs with prescribed girth (Q322341) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Spanning cubic graph designs (Q1045074) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← 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)
- Turán function and \(H\)-decomposition problem for gem graphs (Q1649911) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← 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)
- The real truth about star designs (Q1876685) (← links)
- A cube dismantling problem related to bootstrap percolation (Q1938846) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Decomposing dense bipartite graphs into 4-cycles (Q2260624) (← links)
- Packing degenerate graphs (Q2324574) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Packing seagulls (Q2392035) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Multigraph decomposition into stars and into multistars (Q2487986) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Smaller embeddings of partial \(k\)-star decompositions (Q2684891) (← links)
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
- Using parametric transformations toward polynomial kernels for packing problems allowing overlaps (Q2828236) (← links)
- The existence and construction of \((K_{5}\setminus e)\)-designs of orders 27, 135, 162, and 216 (Q2842261) (← links)
- Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644) (← links)
- Monochromatic Clique Decompositions of Graphs (Q3466344) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs (Q4368813) (← links)
- Constructive Packings of Triple Systems (Q4591229) (← links)
- FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS (Q5055017) (← links)
