Packing [1, ]-factors in graphs of small degree
DOI10.1007/S10878-006-9034-4zbMATH Open1125.05080OpenAlexW2042487433MaRDI QIDQ2460103FDOQ2460103
Paweł Żyliński, Adrian Kosowski, Michal Malafiejski
Publication date: 14 November 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9034-4
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Planar 3DM is NP-complete
- Title not available (Why is that?)
- The NP-Completeness of Edge-Coloring
- An optimal algorithm for intersecting line segments in the plane
- Title not available (Why is that?)
- Cooperative mobile guards in grids
- Edge-packings of graphs and network reliability
- Title not available (Why is that?)
- NP completeness of finding the chromatic index of regular graphs
- On partitioning the edges of graphs into connected subgraphs
- Title not available (Why is that?)
- On grid intersection graphs
- Path factors in cubic graphs
- Complexity of Recognizing Equal Unions in Families of Sets
- Packing of graphs and permutations -- a survey
- Edge decompositions of multigraphs into 3-matchings
- On gallery watchmen in grids
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
- An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
- The decomposition of trees into subtrees
- On-line edge-coloring with a fixed number of colors
- Edge-packing planar graphs by cyclic graphs
- Decompositions of multigraphs into parts with two edges
- Fault Tolerant Guarding of Grids
Cited In (5)
- Approximating maximum edge 2-coloring in simple graphs
- Parameterized and approximation algorithms for finding two disjoint matchings
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Approximating maximum edge 2-coloring in simple graphs via local improvement
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
This page was built for publication: Packing \([1, \Delta ]\)-factors in graphs of small degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460103)
