The k-domatic number of a graph

DOI10.1007/S10587-009-0036-0zbMATH Open1224.05372OpenAlexW2066038995MaRDI QIDQ3070140FDOQ3070140

Authors: Karsten Kämmerling, Lutz Volkmann 

Publication date: 2 February 2011

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/37939

Recommendations

• Bounds on the \(k\)-tuple domatic number of a graph
• The \(\{k\}\)-domatic number of a graph
• On $k$-domatic numbers of graphs
• \(k\)-tuple domatic in graphs
• scientific article; zbMATH DE number 1444486

zbMATH Keywords

dominationvertex partition\(k\)-dominationNordhaus-Gaddum type results\(k\)-domatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Distance Domination in Graphs
• The k-conversion number of regular graphs
• The algorithmic complexity of \(k\)-domatic partition of graphs
• Bounds on the \(k\)-tuple domatic number of a graph
• \(k\)-domination and \(k\)-independence in graphs: A survey
• The roman \(k\)-domatic number of a graph
• Multiple Domination
• The \(\{k\}\)-domatic number of a graph
• On $k$-domatic numbers of graphs
• Title not available (Why is that?)
• Bounds on the upper \(k\)-domination number and the upper \(k\)-star-forming number of a graph
• Title not available (Why is that?)

This page was built for publication: The \(k\)-domatic number of a graph

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