Pages that link to "Item:Q3038617"
From MaRDI portal
The following pages link to On the Complexity of General Graph Factor Problems (Q3038617):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- An improved approximation ratio for the jump number problem on interval orders (Q391978) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Induced graph packing problems (Q604669) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Packing paths perfectly (Q757434) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- The generalized matcher game (Q777420) (← links)
- Chain packing in graphs (Q808291) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- An improved kernelization for \(P_{2}\)-packing (Q991748) (← links)
- A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (Q1005227) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- An extension of matching theory (Q1057288) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
- On the tree packing problem (Q1183337) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- The superstar packing problem (Q2149487) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- Quantifying hierarchical conflicts in homology statements (Q2163958) (← links)
- A degree sequence version of the Kühn-Osthus tiling theorem (Q2195226) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
