scientific article
From MaRDI portal
Publication:3933018
zbMath0476.05062MaRDI QIDQ3933018
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (26)
On the Algorithmic Complexity of Total Domination ⋮ A linear algorithm for finding a minimum dominating set in a cactus ⋮ A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs ⋮ On graphs with equal domination and covering numbers ⋮ Domination in intersecting hypergraphs ⋮ On $f$-domination number of a graph ⋮ An extremal problem for edge domination insensitive graphs ⋮ Factor domination in graphs ⋮ Well irredundant graphs ⋮ The weighted perfect domination problem and its variants ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ The weighted perfect domination problem ⋮ Conical and spherical graphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ Chordal graphs and upper irredundance, upper domination and independence ⋮ Domatically critical and domatically full graphs ⋮ The least point covering and domination numbers of a graph ⋮ On packing and covering numbers of graphs ⋮ Cores of simplicial complexes ⋮ Graphs with equal domination and covering numbers ⋮ Domination and matching in power and generalized power hypergraphs ⋮ Unnamed Item ⋮ Characterization of graphs with equal domination and covering number ⋮ A note on total domination ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The domatic number problem
This page was built for publication:
