On graph decompositions modulo \(k\)

DOI10.1016/S0012-365X(96)00109-4zbMath0951.05087OpenAlexW2157640963MaRDI QIDQ1377772

Alexander D. Scott

Publication date: 2 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00109-4

zbMATH Keywords

edge-partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

The mod k $k$ chromatic index of random graphs ⋮ The mod k $k$ chromatic index of graphs is O(k) $O(k)$

Cites Work

• Unnamed Item
• Unnamed Item
• Regular subgraphs of almost regular graphs
• An uncertainty inequality and zero subsums
• Regular subgraphs of dense graphs
• Diophantine problems in variables restricted to the values 0 and 1
• Zero-sum partition theorems for graphs
• Dense graphs without 3-regular subgraphs
• A combinatorial problem on finite Abelian groups. I

This page was built for publication: On graph decompositions modulo \(k\)