Domination in graphs of minimum degree at least two and large girth
From MaRDI portal
Publication:2482352
DOI10.1007/S00373-007-0770-8zbMATH Open1138.05055OpenAlexW2034107473MaRDI QIDQ2482352FDOQ2482352
Authors: Christian Löwenstein, Dieter Rautenbach 
Publication date: 16 April 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00012930/IfM_Preprint_M_07_09.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domination in graphs with minimum degree two
- Paths, Stars and the Number Three
- Extremal graphs for inequalities involving domination parameters
- On domination in connected cubic graphs
- Characterization of graphs with equal domination and covering number
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- A note on domination, girth and minimum degree
- Title not available (Why is that?)
- Domination in a graph with a 2‐factor
- Title not available (Why is that?)
Cited In (26)
- My favorite domination conjectures in graph theory are bounded
- Relating ordinary and total domination in cubic graphs of large girth
- A characterization of hypergraphs with large domination number
- A note on graphs with large girth and small minus domination number
- Hypergraphs with large domination number and with edge sizes at least three
- Total domination in graphs with given girth
- Domination in a graph with a 2‐factor
- Domination number in graphs with minimum degree two
- Dominating sets inducing large components
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Domination in Cubic Graphs of Large Girth
- Domination and total domination in cubic graphs of large girth
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- Independent domination in subcubic bipartite graphs of girth at least six
- Partial domination in supercubic graphs
- Domination number of graphs with minimum degree five
- Pairs of disjoint dominating sets in connected cubic graphs
- A new bound on the domination number of connected cubic graphs
- A note on domination, girth and minimum degree
- On certain spanning subgraphs of embeddings with applications to domination
- On domination in 2-connected cubic graphs
- Domination number of graphs without small cycles
- Title not available (Why is that?)
- Domination number of cubic graphs with large girth
- Domination in bipartite graphs
- Dominating sets inducing large component in graphs with minimum degree two
This page was built for publication: Domination in graphs of minimum degree at least two and large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482352)
