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 University Press
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/}
}
[1] 1. Dirac, G. A., A property of 4-chromatic graphs and some remarks on critical graphs. Journal London Math. Soc. 27 (1952), 87. Bernhardine ZeidI, Űber 4- und 5-chrome Graphen, Monatsh. Math.62 (1958), 212. Google Scholar
[2] 2. Dirac, G. A., In abstrakten Graphen vorhandene vollstandige 4- Graphen und ihre Unterteilungen, Math. Nachrichten, 22 (1960), 61. Google Scholar
[3] 3. Wagner, K., Beweis einer Abschwächung der Hadwiger Vermutung, Math. Annalen 153 (1964), 139. Google Scholar
Cité par Sources :