✦ LIBER ✦

Chromatic classes of certain 2-connected (n, n + 2)-graphs homeomorphic to K4

✍ Scribed by X.E. Chen; K.Z. Ouyang

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 445 KB
Volume: 172
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00264-6

No coin nor oath required. For personal study only.

✦ Synopsis

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',¢).

📜 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

On the existence of N-connected graphs w

On the existence of N-connected graphs with prescribed degrees (n ≧ 2)

✍ D. L. Wang; D. J. Kleitman 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 648 KB

Equilateral Drawing of 2-Connected Plana

Equilateral Drawing of 2-Connected Planar Chordal Graphs

✍ L. Markenzon; N. Paciornik 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Vibrational energy transfer from N2 to C

Vibrational energy transfer from N2 to CO on electron excitation of N2-CO solids at 4.2 K

✍ W.W. Duley; O. Oehler; D.A. Smith 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Spectra emitted from 0.15 CO-N; solids escited with high encrg elccirons at 4 R show evidence for rcsonant transfer of vibrational &qry from highly excited vibrational levels of N, to Coin the process,Nz(XI z'&, v) + CO(u = 0) --F N,(X'ZL, Y -1) + C0(11= 1) + phonons. Enqg transfer from levels with