๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on the chromaticity of some 2-connected (n,n+3)-graphs

โœ Scribed by F.M. Dong; K.L. Teo; K.M. Koh

Book ID
108315672
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
77 KB
Volume
243
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Chromatic classes of certain 2-connected
Chromatic classes of certain 2-connected (n, n + 2)-graphs II
โœ X.E. Chen; K.Z. Ouyang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

Let S denote the class of 2-connected (n, n + 2)-graphs which have girth 5 and are not homeomorphic to K4. Chromatic classes of graphs in S are determined in this paper.

Chromatic classes of 2-connected (n, n +
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
โœ K.M. Koh; K.L. Teo ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 820 KB

Let P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G-H, if P( G) = P( H). A graph G is chromatically unique if G z H for any graph H such that H-G. Let J? denote the class of 2-connected graphs with n vertices and n+3 edges which contain a

Chromatic classes of certain 2-connected
Chromatic classes of certain 2-connected (n, n + 2)-graphs homeomorphic to K4
โœ X.E. Chen; K.Z. Ouyang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 445 KB

Chromatic classes of 2-connected (n, n + 2)-graphs which are horneomorphic to K4 and have girth 5 are given in this paper. Lemma 1. (a) If(6,~,rl)ยข Uj~3{(j,j-2,j+ 1), (j-2,j+2,j-1)} andFl (6,~,rl)~ Fl(6t, y',rlt ), then F1(6,7,~/) ~ Ft(6',7',ยข).