Geodesic
Labeled Bipartite Blocks
Canadian journal of mathematics, Tome 31 (1979) no. 1, pp. 60-68

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

Graphs which are 2-connected have been called blocks in the graph theoretic literature [3] and stars in the parlance of statistical mechanics [1]. They are also called nonseparable graphs, and in this paper include the complete graph K2 on p = 2 points. The standard terminology of graphical enumeration can be found in [3].When its points are colored using two distinct colors in such a way that adjacent points receive different colors, a graph is called 2-colored. If the colors are considered interchangeable, such a graph is called bicolored. A graph which can be bicolored is called bicolorable. It is obvious that a connected bicolorable graph has a unique bicoloring, and so one can speak of the sizes of its color classes. 
Harary, F.; Robinson, R. W. Labeled Bipartite Blocks. Canadian journal of mathematics, Tome 31 (1979) no. 1, pp. 60-68. doi: 10.4153/CJM-1979-007-3
@article{10_4153_CJM_1979_007_3,
     author = {Harary, F. and Robinson, R. W.},
     title = {Labeled {Bipartite} {Blocks}},
     journal = {Canadian journal of mathematics},
     pages = {60--68},
     year = {1979},
     volume = {31},
     number = {1},
     doi = {10.4153/CJM-1979-007-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-007-3/}
}
TY  - JOUR
AU  - Harary, F.
AU  - Robinson, R. W.
TI  - Labeled Bipartite Blocks
JO  - Canadian journal of mathematics
PY  - 1979
SP  - 60
EP  - 68
VL  - 31
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-007-3/
DO  - 10.4153/CJM-1979-007-3
ID  - 10_4153_CJM_1979_007_3
ER  - 
%0 Journal Article
%A Harary, F.
%A Robinson, R. W.
%T Labeled Bipartite Blocks
%J Canadian journal of mathematics
%D 1979
%P 60-68
%V 31
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-007-3/
%R 10.4153/CJM-1979-007-3
%F 10_4153_CJM_1979_007_3

[1] 1. Ford, G. W. and Uhlenbeck, G. E., Combinatorial problems in the theory of graphs, I, Proc. Nat. Acad. Sci. U.S.A. 42 (1956), 122–128. Google Scholar

[2] 2. Gilbert, E. N., Enumeration of labelled graphs, Can. J. Math. 8 (1956), 405–411. Google Scholar

[3] 3. Harary, F. and Palmer, E. M., Graphical enumeration (Academic Press, New York, 1973). Google Scholar

[4] 4. Melnyk, T. W., Rowlinson, J. S. and Sawford, B. L., The penetrable sphere and related models of liquid-vapour equilibrium, Molecular Physic. 24 (1972), 809–831. Google Scholar

[5] 5. Read, R. C., The number of k-coloured graphs on labelled nodes, Can. J. Math. 12 (1960), 410–414. Google Scholar

[6] 6. Read, R. C. and Wright, E. M., Coloured graphs: A correction and extension, Can. J. Math. 22 (1970), 594–596. Google Scholar

[7] 7. Robinson, R. W., Enumeration of nonseparable graphs, J. Combinatorial Theor. 9 (1970), 327–356. Google Scholar

[8] 8. Wright, E. M., Counting coloured graphs, Can. J. Math. 13 (1961), 683–693. Google Scholar

Cité par Sources :