scientific article; zbMATH DE number 2192159
From MaRDI portal
Publication:5463534
zbMath1073.05046MaRDI QIDQ5463534
Neil J. Calkin, Peter Dankelmann
Publication date: 4 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Disjoint dominating and total dominating sets in graphs ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ On the difference between chromatic number and dynamic chromatic number of graphs ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ Dominating and total dominating partitions in cubic graphs ⋮ A survey of selected recent results on total domination in graphs ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Multiple Domination ⋮ Partitioning the Vertices of a Graph into Two Total Dominating Sets ⋮ Remarks about disjoint dominating sets ⋮ Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
This page was built for publication: