✦ LIBER ✦

Joins of n-degenerate graphs and uniquely (m, n)-partitionable graphs

✍ Scribed by J.M.S Simões-Pereira

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 501 KB
Volume: 21
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90023-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniquely colourable m-dichromatic orient

Uniquely colourable m-dichromatic oriented graphs

✍ V Neumann-Lara; N Santoro; J Urrutia 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 362 KB

On the join of graphs and chromatic uniq

On the join of graphs and chromatic uniqueness

✍ G. L. Chia 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno

An extension of Brooks' theorem to n-deg

An extension of Brooks' theorem to n-degenerate graphs

✍ John Mitchem 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 867 KB

Fw rl ~~(t,~R(QG) denotes the Lick-White vertex-partition number of C In this paper genera',xd Kcmpe paths are used to prove rhat ~"(4;) s {J(G)/(n + I)) if G is not an odd cycle, an (n h I )-regular graph. nor a complete graph on r(n + 1) + 1 vertices. This result generalizes theorems of Brooks and

On the chromatic uniqueness of the graph

On the chromatic uniqueness of the graph W(n, n − 2) + Kk

✍ Feng-Ming Dong; Yanpei Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 360 KB

N-extendability of symmetric graphs

✍ R. E. L. Aldred; D. A. Holton; Dingjun Lou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract It is proved that a cyclically (__k__ − 1)(2__n__ − 1)‐edge‐connected edge transitive __k__‐regular graph with even order is __n__‐extendable, where __k__ ≥ 3 and __k__ − 1 ≥ __n__ ≥ ⌈(__k__ + 1)/2⌉. The bound of cyclic edge connectivity is sharp when __k__ = 3. © 1993 John Wiley & Sons

Representations of graphs modulo n

✍ Anthony B. Evans; Gerd H. Fricke; Carl C. Maneri; Terry A. McKee; Manley Perkel 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 757 KB

## Abstract A graph is representable modulo __n__ if its vertices can be labeled with distinct integers between 0 and __n__, the difference of the labels of two vertices being relatively prime to __n__ if and only if the vertices are adjacent. Erdős and Evans recently proved that every graph is rep