scientific article; zbMATH DE number 4127268
From MaRDI portal
Publication:4206780
zbMath0688.05066MaRDI QIDQ4206780
Publication date: 1989
Full work available at URL: https://eudml.org/doc/32406
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On coupon coloring of Cartesian product of some graphs ⋮ A note on non-dominating set partitions in graphs ⋮ Partitioning claw-free subcubic graphs into two dominating sets ⋮ Disjoint dominating and total dominating sets in graphs ⋮ Graphs with disjoint dominating and paired-dominating sets ⋮ Maker-breaker total domination game ⋮ On domatic and total domatic numbers of Cartesian products of graphs ⋮ Disjoint total dominating sets in near‐triangulations ⋮ On the difference between chromatic number and dynamic chromatic number of graphs ⋮ Dominating and total dominating partitions in cubic graphs ⋮ Coupon-coloring and total domination in Hamiltonian planar triangulations ⋮ A characterization of graphs with disjoint dominating and paired-dominating sets ⋮ Partitioning the vertices of a cubic graph into two total dominating sets ⋮ A survey of selected recent results on total domination in graphs ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Total Roman domatic number of a graph ⋮ Partitioning the Vertices of a Graph into Two Total Dominating Sets ⋮ Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets ⋮ Disjoint paired-dominating sets in cubic graphs ⋮ Algorithm and complexity of the two disjoint connected dominating sets problem on trees
Cites Work
