The Private Neighbor Cube
From MaRDI portal
Publication:4287938
DOI10.1137/S0895480191199026zbMATH Open0795.05078MaRDI QIDQ4287938FDOQ4287938
Authors: 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)
Recommendations
NP-completenessclosed neighbourhoodirredundant setsprivate neighbouropen neighbourhoodprivate neighbor cube
Cited In (20)
- Locally definable vertex set properties are efficiently enumerable
- Weighted irredundance of interval graphs.
- The \(\langle t \rangle \)-property of some classes of graphs
- A lower bound for the CO-irredundance number of a graph
- Linear time algorithm for dominator chromatic number of trestled graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Open irredundance and maximum degree in graphs
- Irredundance perfect graphs
- The private neighbor concept
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Algorithmic aspects of upper edge domination
- Zero-divisor graphs of small upper irredundance number
- Open packing number for some classes of perfect graphs
- Irredundance
- Using maximality and minimality conditions to construct inequality chains
- Neighborhood representatives
- The complexity of irredundant sets parameterized by size
This page was built for publication: The Private Neighbor Cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287938)
