Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-25T06:11:47.883Z Has data issue: false hasContentIssue false
  • English
  • Français

On Indecomposable Graphs

Published online by Cambridge University Press:  20 November 2018

Frank Harary  and
Michael D. Plummer
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.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 19 , 1967 , pp. 800 - 809
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Beineke, L. W., Harary, F., and Plummer, M. D.. On the critical lines of a graph, Pacific J. Math., 21 (1967), to appear.Google Scholar
2. Dulmage, A. L. and Mendelsohn, N. S., Coverings of bipartite graphs, Can. J. Math., 10 (1958), 517–534.Google Scholar
3. Dulmage, A. L. and Mendelsohn, N. S., A structure theory of bipartite graphs of finite exterior dimension, Trans. Roy. Soc. Canada. Sect. III, 53 (1959), 1–13.Google Scholar
4. Erdös, P. and Gallai, T., On the minimal number of vertices representing the edges of a graph, Magyar Tud. Akad. Mat. Kutatö Int. KozL, 6 (1961), 89–96.Google Scholar
5. Erdös, P. and Gallai, T., On the core of a graph, Proc. London Math. Soc. 17 (1967), 305–314.Google Scholar
6. Plummer, M. D., On a family of line-critical graphs, Monatsh. Math., 71 (1967), 40–48.Google Scholar