𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic classes of certain 2-connected (n, n + 2)-graphs II

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

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
299 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

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

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

Maximum chromatic polynomials of 2-conne
Maximum chromatic polynomials of 2-connected graphs
✍ Ioan Tomescu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 345 KB πŸ‘ 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; Ξ») of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments Ξ» ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every Ξ» ≧ 3 and __n__ β‰  5. We also determine max{__P(

Fragments in 2-Critically n-Connected Gr
Fragments in 2-Critically n-Connected Graphs
✍ J.J. Su πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 428 KB

Mader conjectured that every non-complete \(k\)-critically \(n\)-connected graph has \((2 k+2)\) pairwise disjoint fragments. The conjecture was verified by Mader for \(k=1\). In this paper, we prove that this conjecture holds also for \(k=2\). 1993 Academic Press. Inc.

Hamiltonian N2-locally connected claw-fr
Hamiltonian N2-locally connected claw-free graphs
✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja Β΄c Λ‡ek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro