On a conjecture on total domination in claw-free cubic graphs

DOI10.1016/J.DISC.2010.07.006MaRDI QIDQ710600zbMATH OpenOpenAlexWikidataFDO

Authors Justin Southey, Michael A. Henning

Publication date 19 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.07.006

zbMATH Keywords

boundstotal dominationclaw-free cubic graphsdischarging rules

Mathematics Subject Classification ID

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

Recommendations

• On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound
• scientific article; zbMATH DE number 1885949
• Locating-total domination in claw-free cubic graphs
• Bounds on total domination in claw-free cubic graphs
• Semitotal domination in claw-free cubic graphs

Cites work

• 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 1885949 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Bounds on total domination in claw-free cubic graphs
• Claw-free graphs---a survey
• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. II: Non-orientable prismatic graphs
• Claw-free graphs. III: Circular interval graphs
• Claw-free graphs. IV: Decomposition theorem
• Claw-free graphs. V. Global structure
• Covering all cliques of a graph
• Hypergraphs with large transversal number and with edge sizes at least 3
• Paired-domination in claw-free cubic graphs
• Small transversals in hypergraphs
• Some remarks on domination
• Total domination in claw-free graphs with minimum degree 2
• Total domination in graphs
• Total domination of graphs and small transversals of hypergraphs

Cited in

(15)

• Counting labeled claw-free cubic graphs by connectivity
• On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound
• Fault-tolerant detectors for distinguishing sets in cubic graphs
• Extremal cubic graphs for fault-tolerant locating domination
• A characterization of graphs with semitotal domination number one-third their order
• Domination versus edge domination
• Total forcing and zero forcing in claw-free cubic graphs
• Triangles and (total) domination in subcubic graphs
• Locating-total domination in claw-free cubic graphs
• On the Erdős-Gyárfás conjecture in claw-free graphs
• Semipaired domination in claw-free cubic graphs
• Domination versus total domination in claw-free cubic graphs
• Disjunctive total domination in graphs
• Semitotal domination in claw-free cubic graphs
• Upper total domination in claw-free cubic graphs

This page was built for publication: On a conjecture on total domination in claw-free cubic graphs

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