✦ LIBER ✦

On chromatic uniqueness of two infinite families of graphs

✍ Scribed by Feng-Ming Dong

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 229 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170312

No coin nor oath required. For personal study only.

✦ Synopsis

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 chromatically unique. © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Infinite families of 4-chromatic Grötzsc

Infinite families of 4-chromatic Grötzsch-Sachs graphs

✍ Andrey A. Dobrynin; Leonid S. Mel'nikov 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract Let __G__ be a 4‐regular planar graph and suppose that __G__ has a cycle decomposition __S__ (i.e., each edge of __G__ is in exactly one cycle of the decomposition) with every pair of adjacent edges on a face always in different cycles of __S__. Such graphs, called Grötzsch‐Sachs graphs

A note on chromatic uniqueness of graphs

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

Note on Infinite Families of Trivalent S

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Seymour Lipschutz; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.

The fractional chromatic number of infin

The fractional chromatic number of infinite graphs

✍ Imre Leader 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 398 KB 👁 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g

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.

An infinite family of biprimitive semisy

An infinite family of biprimitive semisymmetric graphs

✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti