scientific article

zbMath0625.05042MaRDI QIDQ3027055

Bohdan Zelinka

Publication date: 1986

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

vertex partitionconnected domatic numbermaximum number of subsets

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (6)

Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ On connected \(k\)-domination numbers of graphs. ⋮ Completely independent spanning trees in some regular graphs ⋮ Connected Domatic Number in Planar Graphs ⋮ Connected Domination ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Total domination in graphs
• Towards a theory of domination in graphs

This page was built for publication: