Dominating and total dominating partitions in cubic graphs

DOI10.2478/S11533-011-0014-2MaRDI QIDQ657306zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

cubic graphstotal dominationvertex partitionhypergraph transversal

Mathematics Subject Classification ID

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

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
• scientific article; zbMATH DE number 1885949

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 5531984 (Why is no real title available?)
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1124606 (Why is no real title available?)
• scientific article; zbMATH DE number 1462928 (Why is no real title available?)
• scientific article; zbMATH DE number 2192114 (Why is no real title available?)
• scientific article; zbMATH DE number 2192159 (Why is no real title available?)
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• A note on graphs with disjoint dominating and total dominating sets
• An independent dominating set in the complement of a minimum dominating set of a tree
• Approximating theDomatic Number
• Covering all cliques of a graph
• Disjoint dominating and total dominating sets in graphs
• Hypergraphs with large transversal number and with edge sizes at least 3
• Inverse domination in graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• On a conjecture about inverse domination in graphs.
• 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
• Remarks about disjoint dominating sets
• Small transversals in hypergraphs
• Some remarks on domination
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Total domination in graphs with given girth
• Total domination of graphs and small transversals of hypergraphs

Cited in

(13)

• On (1,2)-domination in cubic graphs
• On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
• Spanning trees with disjoint dominating and 2-dominating sets
• Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• 2-Coupon Coloring of Cubic Graphs Containing 3-Cycle or 4-Cycle
• Acyclic total dominating sets in cubic graphs
• On domination in Hamiltonian cubic graphs
• Disjoint dominating and 2-dominating sets in graphs
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees
• scientific article; zbMATH DE number 15376 (Why is no real title available?)
• Total domination versus domination in cubic graphs
• Minimal graphs with disjoint dominating and paired-dominating sets
• Partitioning the vertices of a cubic graph into two total dominating sets

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)