✦ LIBER ✦

A class of 2-chromatic SQS(22)

✍ Scribed by K.T. Phelps

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 351 KB
Volume: 97
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90448-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic number of a class of pseud

The chromatic number of a class of pseudo-2-manifolds

✍ A. K. Dewdney 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 310 KB

The chromatic class of a multigraph

✍ V. G. Vizing 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 857 KB

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.

On the chromatic equivalence class of a

On the chromatic equivalence class of a family of graphs

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant

Note on Choudum's “chromatic bounds for

Note on Choudum's “chromatic bounds for a class of graphs”

✍ Medha Javdekar 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract If a graph __G__ has no induced subgraph isomorphic to __K__~1,3′~ __K__~5~‐__e__, or a third graph that can be selected from two specific graphs, then the chromatic number of __G__ is either __d__ or __d__ + 1, where __d__ is the maximum order of a clique in __G__.

On σ-polynomials and a class of chromati

On σ-polynomials and a class of chromatically unique graphs

✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi