𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The search for chromatically unique graphs — II

✍ Scribed by K.M. Koh; K.L. Teo

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The list of chromatically unique graphs
The list of chromatically unique graphs of order seven and eight
✍ Nian-Zu Li 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 947 KB

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.

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

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

A new method for proving chromatic uniqu
A new method for proving chromatic uniqueness of graphs
✍ Ru-Ying Liu; Lian-Chang Zhao 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 359 KB

We give a brief survey on a new method for proving the chromatic uniqueness of graphs by their adjoint polynomials. We obtain some simpler proofs of relevant theorems and a new family of chromatically unique graphs.