Packing [1, ]-factors in graphs of small degree

DOI10.1007/S10878-006-9034-4MaRDI QIDQ2460103zbMATHOpenAlexFDO

Authors Adrian Kosowski, Michal Malafiejski, Paweł Żyliński

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

zbMATH Keywords

Edge-colorable subgraphFault tolerant guardsPacking factors

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packingk-edge trees in graphs of restricted vertex degrees
• scientific article; zbMATH DE number 15366
• Packing triangles in bounded degree graphs.
• Packings by Complete Bipartite Graphs
• Edge-disjoint packings of graphs

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1947051 (Why is no real title available?)
• scientific article; zbMATH DE number 1500690 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
• An optimal algorithm for intersecting line segments in the plane
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Complexity of Recognizing Equal Unions in Families of Sets
• Cooperative mobile guards in grids
• Decompositions of multigraphs into parts with two edges
• Edge decompositions of multigraphs into 3-matchings
• Edge-packing planar graphs by cyclic graphs
• Edge-packings of graphs and network reliability
• Fault Tolerant Guarding of Grids
• NP completeness of finding the chromatic index of regular graphs
• On gallery watchmen in grids
• On grid intersection graphs
• On partitioning the edges of graphs into connected subgraphs
• On-line edge-coloring with a fixed number of colors
• Packing of graphs and permutations -- a survey
• Path factors in cubic graphs
• Planar 3DM is NP-complete
• The NP-Completeness of Edge-Coloring
• The decomposition of trees into subtrees

Cited in

(5)

• Approximating maximum edge 2-coloring in simple graphs via local improvement
• 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
• 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)