scientific article; zbMATH DE number 1462928
From MaRDI portal
Publication:4487071
Recommendations
Cites work
Cited in
(40)- A new upper bound on the total domination number of a graph
- Total domination in partitioned graphs
- Signed total domination in graphs.
- Total domination versus domination in cubic graphs
- Essential upper bounds on the total domination number
- Restricted total domination in graphs
- An improved upper bound on the total restrained domination number in cubic graphs
- Girth and total domination in graphs
- Total domination and the Caccetta-Häggkvist conjecture
- Generalized power domination in claw-free regular graphs
- On the forcing domination and the forcing total domination numbers of a graph
- \(F_3\)-domination problem of graphs
- Three-arc graphs: characterization and domination
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Relationships between total domination, order, size, and maximum degree of graphs
- On the total domination number of graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Some remarks on domination
- Graphs with large total domination number
- Locating-total domination in claw-free cubic graphs
- scientific article; zbMATH DE number 1833098 (Why is no real title available?)
- scientific article; zbMATH DE number 1895061 (Why is no real title available?)
- scientific article; zbMATH DE number 861318 (Why is no real title available?)
- A note on total domination in 5-regular graphs
- My favorite domination conjectures in graph theory are bounded
- Lower bounds on the total domination number of a graph
- Edge-vertex domination on interval graphs
- Dominating and total dominating partitions in cubic graphs
- Domination parameters and added matchings
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- Upper signed \(k\)-domination in a general graph
- More on limited packings in graphs
- Total domination in claw-free graphs with minimum degree 2
- Bounds on total domination in claw-free cubic graphs
- Total domination of graphs and small transversals of hypergraphs
- Total restrained domination in graphs with minimum degree two
- Matching properties in total domination vertex critical graphs
- A survey of selected recent results on total domination in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487071)