𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The list of chromatically unique graphs of order seven and eight

✍ Scribed by Nian-Zu Li

Book ID
104113792
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
947 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Note. In the following list, Gij (resp., gij) denotes the jth chromatically unique graph of size i and order 7 (resp., order 8). A graph with a 'C' represents its complement.

πŸ“œ SIMILAR VOLUMES

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.

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

Chromatic uniqueness of the generalized
Chromatic uniqueness of the generalized ΞΈ-graph
✍ Beatrice Loerinc πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 323 KB

A generalized O-graph i.~ a wnnected graph with 3 palths between a pair of vertices of degree 3. It is showi:~ that uny graph having the same ckomatic polynomial as a generaiized O-graph, must be isomorphic to tk generalized O-graph.

The chromatic uniqueness of complete bip
The chromatic uniqueness of complete bipartite graphs
✍ Shaoji Xu πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th