On Graphs that do not Contain a Thomsen Graph
Canadian mathematical bulletin, Tome 9 (1966) no. 3, pp. 281-285
Voir la notice de l'article provenant de la source Cambridge
A Thomsen graph [2, p. 22] consists of six vertices partitioned into two classes of three each, with every vertex in one class connected to every vertex in the other; it is the graph of the “gas, water, and electricity” problem [1, p. 206]. (All graphs considered in this paper will be undirected, having neither loops nor multiple edges.)
Brown, W. G. On Graphs that do not Contain a Thomsen Graph. Canadian mathematical bulletin, Tome 9 (1966) no. 3, pp. 281-285. doi: 10.4153/CMB-1966-036-2
@article{10_4153_CMB_1966_036_2,
author = {Brown, W. G.},
title = {On {Graphs} that do not {Contain} a {Thomsen} {Graph}},
journal = {Canadian mathematical bulletin},
pages = {281--285},
year = {1966},
volume = {9},
number = {3},
doi = {10.4153/CMB-1966-036-2},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-036-2/}
}
Cité par Sources :