Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T18:11:43.290Z Has data issue: false hasContentIssue false

On Indecomposable Graphs

Published online by Cambridge University Press:  20 November 2018

Frank Harary
Affiliation:
The University of Michigan
Michael D. Plummer
Affiliation:
The University of Michigan
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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. The point covering number α(G) is the number of points in any minimum cover of G. Let [V1, V2, … , Vr], r > 1 be a partition of V(G), the set of points of G. Let Gi be the subgraph of G spanned by Vi for i = 1, 2, … , r.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967