A note on domination, girth and minimum degree
From MaRDI portal
Publication:2483423
Recommendations
Cites work
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Domination in graphs with minimum degree two
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2174617 (Why is no real title available?)
- scientific article; zbMATH DE number 2235063 (Why is no real title available?)
Cited in
(9)- A note on graphs with large girth and small minus domination number
- An Erdős-Pósa theorem on neighborhoods and domination number
- Learning bounds via sample width for classifiers on finite metric spaces
- Domination in graphs of minimum degree at least two and large girth
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- A note on minimum graphs with girth pair (4, 2l + 1)
- scientific article; zbMATH DE number 2235063 (Why is no real title available?)
- Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
- Domination in bipartite graphs
This page was built for publication: A note on domination, girth and minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483423)