Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings

DOI10.1006/jctb.1998.1883zbMath0981.05086OpenAlexW2020837387MaRDI QIDQ1305535

Takao Nishizeki, Xiao Zhou

Publication date: 14 March 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1883

zbMATH Keywords

edge-coloringdegree-constrained subgraphs decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• [a,b-factors of graphs]
• Simplified existence theorems for \((g,f)\)-factors
• Factors and factorizations of graphs—a survey
• [a,b-factorization of a graph]
• A generalization of edge-coloring in graphs
• On the f-coloring of multigraphs
• A fast parallel algorithm for routing in permutation networks
• The NP-Completeness of Edge-Coloring
• [a,b‐factorizations of graphs]
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings