On Indecomposable Graphs
Work
Year: 1967
Type: article
Abstract: A set of points M of a graph G is a point cover if each line of G is incident with at least one point of M. A minimum cover (abbreviated m.c.) for G is a point cover with a minimum number of points. T... more
Source: Canadian Journal of Mathematics
Authors Frank Harary, Michael D. Plummer
Institution University of Michigan–Ann Arbor
Cites: 2
Cited by: 28
Related to: 10
FWCI: 0.948
Citation percentile (by year/subfield): 84.95
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze