Dominating Bipartite Subgraphs in Graphs

DOI10.7151/dmgt.1263zbMath1075.05065OpenAlexW2079555741MaRDI QIDQ5316262

Gábor Bacsó, Danuta Michalak, Zsolt Tuza

Publication date: 12 September 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ad28da97c38f2b4536b32dd6bca6b3cd1916af89

zbMATH Keywords

bipartite graphdominating setdominating subgraph\(k\)-partitie graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Hereditarily dominated graphs ⋮ A New Characterization of P 6-Free Graphs ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ Complete description of forbidden subgraphs in the structural domination problem

This page was built for publication: Dominating Bipartite Subgraphs in Graphs