Chromatic Number and Topological Complete Subgraphs
Canadian mathematical bulletin, Tome 8 (1965) no. 6, pp. 711-715

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

DOI

A graph with m(>1) vertices, each pair of distinct vertices connected by an edge, and also a graph obtained from such a graph by the process of subdividing edges through the insertion of new vertices of valency 2, will be denoted by ≪m, o≫. A graph obtained from a graph with m(>2) vertices in which each pair of distinct vertices are connected by an edge, by deleting n (≤ m-1) edges incident with one and the same vertex, and also a graph obtained from such a graph by the process of subdividing edges through the insertion of new vertices of valency 2, will be denoted by ≪m, n≫.
Dirac, G. A. Chromatic Number and Topological Complete Subgraphs. Canadian mathematical bulletin, Tome 8 (1965) no. 6, pp. 711-715. doi: 10.4153/CMB-1965-052-0
@article{10_4153_CMB_1965_052_0,
     author = {Dirac, G. A.},
     title = {Chromatic {Number} and {Topological} {Complete} {Subgraphs}},
     journal = {Canadian mathematical bulletin},
     pages = {711--715},
     year = {1965},
     volume = {8},
     number = {6},
     doi = {10.4153/CMB-1965-052-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-052-0/}
}
TY  - JOUR
AU  - Dirac, G. A.
TI  - Chromatic Number and Topological Complete Subgraphs
JO  - Canadian mathematical bulletin
PY  - 1965
SP  - 711
EP  - 715
VL  - 8
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-052-0/
DO  - 10.4153/CMB-1965-052-0
ID  - 10_4153_CMB_1965_052_0
ER  - 
%0 Journal Article
%A Dirac, G. A.
%T Chromatic Number and Topological Complete Subgraphs
%J Canadian mathematical bulletin
%D 1965
%P 711-715
%V 8
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1965-052-0/
%R 10.4153/CMB-1965-052-0
%F 10_4153_CMB_1965_052_0

Cité par Sources :