A note on degree-continuous graphs
Czechoslovak Mathematical Journal, Tome 57 (2007) no. 3, pp. 1043-1047
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.
The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.
Classification :
05C07, 05C12
Keywords: order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph
Keywords: order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph
@article{CMJ_2007_57_3_a19,
author = {Lin, Chiang and Ou, Wei-Bo},
title = {A note on degree-continuous graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {1043--1047},
year = {2007},
volume = {57},
number = {3},
mrnumber = {2356939},
zbl = {1174.05038},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2007_57_3_a19/}
}
Lin, Chiang; Ou, Wei-Bo. A note on degree-continuous graphs. Czechoslovak Mathematical Journal, Tome 57 (2007) no. 3, pp. 1043-1047. http://geodesic.mathdoc.fr/item/CMJ_2007_57_3_a19/