Algorithmic Aspects of Neighborhood Numbers
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 6 (1) , 24-29
- https://doi.org/10.1137/0406002
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Covering the cliques of a graph with verticesDiscrete Mathematics, 1992
- Clique-transversal sets of line graphs and complements of line graphsDiscrete Mathematics, 1991
- Neighborhood perfect graphsDiscrete Mathematics, 1986
- Totally-Balanced and Greedy MatricesSIAM Journal on Algebraic Discrete Methods, 1985
- Covering, Packing and Generalized PerfectionSIAM Journal on Algebraic Discrete Methods, 1985
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972