The Private Neighbor Cube

DOI10.1137/S0895480191199026zbMath0795.05078MaRDI QIDQ4287938

Michael R. Fellows, Stephen T. Hedetniemi, David P. Jacobs, Gerd H. Fricke

Publication date: 29 August 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-completenessclosed neighbourhoodirredundant setsprivate neighbouropen neighbourhoodprivate neighbor cube

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35)

Related Items (19)

Enumeration of Maximal Irredundant Sets for Claw-Free Graphs ⋮ Enumeration of maximal irredundant sets for claw-free graphs ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Irredundance perfect graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Zero-divisor graphs of small upper irredundance number ⋮ Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack ⋮ The complexity of irredundant sets parameterized by size ⋮ Locally definable vertex set properties are efficiently enumerable ⋮ A lower bound for the CO-irredundance number of a graph ⋮ Enumeration and maximum number of maximal irredundant sets for chordal graphs ⋮ Algorithmic aspects of upper edge domination ⋮ Open irredundance and maximum degree in graphs ⋮ The \(\langle t \rangle \)-property of some classes of graphs ⋮ Linear time algorithm for dominator chromatic number of trestled graphs ⋮ Irredundance ⋮ The Private Neighbor Concept ⋮ OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS ⋮ Weighted irredundance of interval graphs.

This page was built for publication: The Private Neighbor Cube