Geodesic
On Indecomposable Graphs
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 800-809

Voir la notice de l'article provenant de la source Cambridge University Press

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. 
Harary, Frank; Plummer, Michael D. On Indecomposable Graphs. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 800-809. doi: 10.4153/CJM-1967-074-7
@article{10_4153_CJM_1967_074_7,
     author = {Harary, Frank and Plummer, Michael D.},
     title = {On {Indecomposable} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {800--809},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-074-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-074-7/}
}
TY  - JOUR
AU  - Harary, Frank
AU  - Plummer, Michael D.
TI  - On Indecomposable Graphs
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 800
EP  - 809
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-074-7/
DO  - 10.4153/CJM-1967-074-7
ID  - 10_4153_CJM_1967_074_7
ER  - 
%0 Journal Article
%A Harary, Frank
%A Plummer, Michael D.
%T On Indecomposable Graphs
%J Canadian journal of mathematics
%D 1967
%P 800-809
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-074-7/
%R 10.4153/CJM-1967-074-7
%F 10_4153_CJM_1967_074_7

[1] 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] 2. Dulmage, A. L. and Mendelsohn, N. S., Coverings of bipartite graphs, Can. J. Math., 10 (1958), 517–534. Google Scholar

[3] 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] 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] 5. Erdös, P. and Gallai, T., On the core of a graph, Proc. London Math. Soc. 17 (1967), 305–314. Google Scholar

[6] 6. Plummer, M. D., On a family of line-critical graphs, Monatsh. Math., 71 (1967), 40–48. Google Scholar

Cité par Sources :