Domination in bipartite graphs

DOI10.1016/j.disc.2007.12.051zbMath1181.05069OpenAlexW2066420770MaRDI QIDQ998499

Dieter Rautenbach, Jochen Harant

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

zbMATH Keywords

bipartitecycle lengthprobabilistic methoddomination number

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Domination number of graphs without small cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• A note on the domination number of a bipartite graph
• Domination in graphs of minimum degree at least two and large girth
• A note on domination, girth and minimum degree
• BOUNDS ON THE DOMINATION NUMBER OF A GRAPH
• Domination in graphs with minimum degree two
• A note on domination in bipartite graphs
• A Winning Strategy for the Ramsey Graph Game
• Domination in a graph with a 2‐factor

This page was built for publication: Domination in bipartite graphs