On graph decompositions modulo k

DOI10.1016/S0012-365X(96)00109-4MaRDI QIDQ1377772zbMATH OpenOpenAlexFDO

Authors Alex 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)

Recommendations

• Graph factors modulo k
• Graph decompositions without isolated vertices. II
• The mod k k chromatic index of graphs is O(k) O(k)
• scientific article; zbMATH DE number 4012650

Cites work

• A combinatorial problem on finite Abelian groups. I
• An uncertainty inequality and zero subsums
• Dense graphs without 3-regular subgraphs
• Diophantine problems in variables restricted to the values 0 and 1
• scientific article; zbMATH DE number 426361 (Why is no real title available?)
• scientific article; zbMATH DE number 3387622 (Why is no real title available?)
• Regular subgraphs of almost regular graphs
• Regular subgraphs of dense graphs
• Zero-sum partition theorems for graphs

Cited in

(10)

• Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
• scientific article; zbMATH DE number 5572980 (Why is no real title available?)
• Graph factors modulo k
• An Algorithm for the Modular Decomposition of Hypergraphs
• scientific article; zbMATH DE number 2094440 (Why is no real title available?)
• The mod k $k$ chromatic index of random graphs
• The mod k k chromatic index of graphs is O(k) O(k)
• Computing well-covered vector spaces of graphs using modular decomposition
• On the mod k chromatic index of graphs
• On modular edge colorings of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377772)