✦ LIBER ✦

On the chromatic equivalence class of a family of graphs

✍ Scribed by G.L. Chia

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 196 KB
Volume: 162
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00320-v

No coin nor oath required. For personal study only.

✦ Synopsis

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. Li and Whitehead Jr. conjecture that U3,4(n) forms a chromatic equivalence class by itself. In this note we prove the conjecture in the affirmative.

📜 SIMILAR VOLUMES

Classes of chromatically unique or equiv

Classes of chromatically unique or equivalent graphs

✍ Mieczys[lstrok]aw Borowiecki; Ewa Drgas-Burchardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 439 KB

Classes of chromatically equivalent grap

Classes of chromatically equivalent graphs and polygon trees

✍ Shaoji Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 747 KB

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

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

On the chromatic uniquenes of bipartite

On the chromatic uniquenes of bipartite graphs

✍ Pablo M Salzberg; Miguel A López; Reinaldo E Giudici 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 500 KB

We prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km,,,+k, l~rt3K,,,,,,,+k, with m~>2 and 0~ 3, where K~,,, denote the graph obtained from K,,,n by deleting one edge. As a particular case we prove a conjecture made by C.Y. Chao in