𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs of order n with locating-chromatic number n−1

✍ Scribed by Gary Chartrand; David Erwin; Michael A. Henning; Peter J. Slater; Ping Zhang

Book ID
108315859
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
181 KB
Volume
269
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular graphs with prescribed chromatic
Regular graphs with prescribed chromatic number
✍ L. Caccetta; N. J. Pullman 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract We determine the minimum number of edges in a regular connected graph on __n__ vertices, containing a complete subgraph of order __k__ ≤ __n__/2. This enables us to confirm and strengthen a conjecture of P. Erdös on the existence of regular graphs with prescribed chromatic number.

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

Estimates of coefficients of chromatic p
Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs
✍ Philippe Pitteloud 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract This paper is mainly concerned with classes of simple graphs with exactly __c__ connected components, __n__ vertices and __m__ edges, for fixed __c,n,m__ ∈ ℕ. We find an optimal lower bound for the __i__th coefficient of the chromatic polynomial of a graph in such a class and also an op