Proceedings of the National Academy of Sciences · 1981 · 38 citations · 2 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsSet TheoryCombinatorial EnumerationEnumerative CombinatoricsGeometric GraphsGraph AlgorithmsGraph TheoryCombinatorial RepresentationsEnumeration Algorithms For GraphsEnumerative Graph TheoryFinite Set EnumerationGraph EnumerationIncidence GraphsIncidence StructuresIndependent Set Algorithms
THE NECESSARY MATHEMATICAL MACHINERY IS DEVELOPED FOR ENUMERATION OF THE FOLLOWING TYPES OF SPECIAL SUBSETS OF THE VERTICES OR EDGES OF A GENERAL GRAPH: (i) independent sets, (ii) connected sets, (iii) point and line covers, (iv) externally stable sets, (v) kernels, and (vi) irredundant sets.
2
Graph Theory with Applications
E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations
A Handbook of Integer Sequences
J. W. W., N. J. A. Sloane · Mathematics of Computation · 1974 · 355 citations