Domination in partitioned graphs
From MaRDI portal
Publication:4786799
DOI10.7151/dmgt.1169zbMath1016.05057OpenAlexW2049816950MaRDI QIDQ4786799
Zsolt Tuza, Preben Dahl Vestergaard
Publication date: 7 August 2003
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1169
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Domination in partitioned graphs with minimum degree two ⋮ A new lower bound on the independence number of a graph and applications ⋮ Independence in 5-uniform hypergraphs ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ Total domination in partitioned trees and partitioned graphs with minimum degree two ⋮ Transversals in 4-uniform hypergraphs ⋮ Total domination in partitioned graphs
This page was built for publication: Domination in partitioned graphs
