Towards a theory of domination in graphs
- 1 September 1977
- Vol. 7 (3) , 247-261
- https://doi.org/10.1002/net.3230070305
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- Two Bounds for the Domination Number of a GraphIMA Journal of Applied Mathematics, 1974
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- On the composition and decomposition of cluttersJournal of Combinatorial Theory, Series B, 1971
- On covering sets and error-correcting codesJournal of Combinatorial Theory, Series A, 1971
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- On uniquely colorable planar graphsJournal of Combinatorial Theory, 1969
- On Complementary GraphsThe American Mathematical Monthly, 1956