A note on the domination number of a bipartite graph

DOI10.1007/PL00001298MaRDI QIDQ1600802zbMATH OpenOpenAlexFDO

Authors Jochen Harant, Anja Pruchnewski

Publication date 16 June 2002

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00001298

zbMATH Keywords

bipartite graphdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Review text

Upper bounds on the domination number of a bipartite graph are established. The same approach leads to similar results for arbitrary graphs.

Cited in

(3)

• New bounds on domination and independence in graphs
• A note on the domination number in bipartite graphs
• Domination in bipartite graphs

This page was built for publication: A note on the domination number of a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1600802)