The following pages link to Edge-disjoint packings of graphs (Q1326750):
Displaying 15 items.
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge-packing in planar graphs (Q1272595) (← links)
- Graphs that are randomly packable by some common disconnected graphs (Q1286572) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Graph packings (Q2816101) (← links)
- Partial Degree Bounded Edge Packing Problem (Q2898010) (← links)
- (Q4415391) (← links)
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)
