scientific article
From MaRDI portal
Publication:3791195
zbMath0647.05060MaRDI QIDQ3791195
John Pfaff, Stephen T. Hedetniemi, Renu C. Laskar
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)
Related Items (28)
Enumeration of Maximal Irredundant Sets for Claw-Free Graphs ⋮ Enumeration of maximal irredundant sets for claw-free graphs ⋮ Irredundance perfect graphs ⋮ Labeling algorithms for domination problems in sun-free chordal graphs ⋮ On the product of upper irredundance numbers of a graph and its complement ⋮ Well irredundant graphs ⋮ Total domination in block graphs ⋮ Maximal irredundant functions ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ Chordal graphs and upper irredundance, upper domination and independence ⋮ Dominating sets in perfect graphs ⋮ Permutation graphs: Connected domination and Steiner trees ⋮ The complexity of irredundant sets parameterized by size ⋮ Irredundance number versus domination number ⋮ On packing and covering numbers of graphs ⋮ Dominating cliques in graphs ⋮ Irredundancy in circular arc graphs ⋮ Total domination in interval graphs ⋮ The complexity of domination problems in circle graphs ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ The total irredundance numbers on graphs ⋮ Irredundance ⋮ The Private Neighbor Concept ⋮ Weighted connected domination and Steiner trees in distance-hereditary graphs ⋮ The b-chromatic number of a graph ⋮ Inequalities involving the irredundance number of a graph ⋮ Weighted irredundance of interval graphs. ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
