✦ LIBER ✦

A note on chromatic uniqueness of graphs

✍ Scribed by G. L. Chia

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 122 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100413

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

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__.

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

Classification of chromatically unique g

Classification of chromatically unique graphs having quadratic σ-polynomials

✍ Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Frucht and Giudici classified all graphs having quadratic a-polynomials. Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

Note on thenth chromatic numbers of the

Note on thenth chromatic numbers of the Gr�tzsch graph

✍ Stahl, Saul 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 2 views

It is shown that the n t h chromatic numbers of the Grotzsch graph provide the answer to an issue raised by

The number of shortest cycles and the ch

The number of shortest cycles and the chromatic uniqueness of a graph

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 2 views

## Abstract For a graph __G__, let __g__(__G__) and σ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for σ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when σ~g~(__G__)