Factor \(d\)-domatic colorings of graphs

DOI10.1016/S0012-365X(02)00518-6zbMath1012.05066OpenAlexW1975645051MaRDI QIDQ1868834

Noga Alon, Guillaume Fertin, Ladislav Stacho, Thomas C. Shermer, Arthur L. Liestman

Publication date: 28 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00518-6

zbMATH Keywords

treedistancedomination\(d\)-domatic coloring\(k\)-factoringmatched-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Edge-disjoint spanners in Cartesian products of graphs ⋮ Distance Domination in Graphs

This page was built for publication: Factor \(d\)-domatic colorings of graphs