Dominating and total dominating partitions in cubic graphs

DOI10.2478/S11533-011-0014-2zbMATH Open1233.05151OpenAlexW1976691702MaRDI QIDQ657306FDOQ657306

Justin Southey, Michael A. Henning

Publication date: 16 January 2012

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-011-0014-2

Recommendations

• Partitioning the vertices of a cubic graph into two total dominating sets
• Total domination versus domination in cubic graphs
• Cubic graphs with total domatic number at least two
• On domination in Hamiltonian cubic graphs
• [[:Publication:4798532|Title not available (Why is that?)]]

zbMATH Keywords

cubic graphstotal dominationvertex partitionhypergraph transversal

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?)
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Some remarks on domination
• Total domination of graphs and small transversals of hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating theDomatic Number
• Remarks about disjoint dominating sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total domination in graphs with given girth
• Title not available (Why is that?)
• Disjoint dominating and total dominating sets in graphs
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Inverse domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Title not available (Why is that?)
• Pairs of disjoint dominating sets and the minimum degree of graphs
• Partitioning a graph into a dominating set, a total dominating set, and something else
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• ON THE TWO-COLOURING OF HYPERGRAPHS
• An independent dominating set in the complement of a minimum dominating set of a tree

Cited In (7)

• Partitioning the vertices of a cubic graph into two total dominating sets
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• Disjoint dominating and 2-dominating sets in graphs
• Minimal graphs with disjoint dominating and paired-dominating sets
• Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• Spanning trees with disjoint dominating and 2-dominating sets
• Title not available (Why is that?)

This page was built for publication: Dominating and total dominating partitions in cubic graphs

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