Domination in bipartite graphs
From MaRDI portal
Publication:998499
DOI10.1016/J.DISC.2007.12.051zbMATH Open1181.05069OpenAlexW2066420770MaRDI QIDQ998499FDOQ998499
Authors: Jochen Harant, Dieter Rautenbach
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00012929/IfM_Preprint_M_07_08.pdf
Recommendations
- Domination in partitioned graphs
- Domination number of graphs without small cycles
- Upper bounds on the domination number of a graph in terms of order and minimum degree.
- Domination in graphs with minimum degree two
- Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
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 of minimum degree at least two and large girth
- Title not available (Why is that?)
- Domination in graphs with minimum degree two
- A note on the k-domination number of a graph
- A note on domination in bipartite graphs
- A Winning Strategy for the Ramsey Graph Game
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
- Title not available (Why is that?)
- A note on the domination number of a bipartite graph
- A note on domination, girth and minimum degree
- Title not available (Why is that?)
- Domination in a graph with a 2‐factor
Cited In (16)
- Order-sensitive domination in partially ordered sets and graphs
- Finding a dominating set on bipartite graphs
- Bipartite graphs are not universal fixers
- Domination in partitioned graphs with minimum degree two
- Title not available (Why is that?)
- Domination, packing and excluded minors
- Dominating Bipartite Subgraphs in Graphs
- Title not available (Why is that?)
- Domination in convex and chordal bipartite graphs
- Title not available (Why is that?)
- Domination in Bipartite Graphs and in Their Complements
- Title not available (Why is that?)
- Domination number of graphs without small cycles
- Domination parameters for the bishops graph
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Domination in partitioned graphs
This page was built for publication: Domination in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998499)