✦ LIBER ✦

The existence of uniquely −G colourable graphs

✍ Scribed by D. Achlioptas; J.I. Brown; D.G. Corneil; M.S.O. Molloy

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 577 KB
Volume: 179
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00022-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the order of uniquely (k,m)-colourabl

On the order of uniquely (k,m)-colourable graphs

✍ Izak Broere; Marietjie Frick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 578 KB

The size of graphs uniquely hamiltonian-

The size of graphs uniquely hamiltonian-connected from a vertex

✍ G.R.T Hendry 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 220 KB

A graph G is called uniquely hamiltonian-connected from a vertex v of G if G contains exactly one v-u hamiltonian path for each vertex u, u ~ v. It is shown that if G is uniquely hamiltonian-connected from a vertex v and G has order n/> 5, then G has exactly ½(3n-3) edges, G -v has exactly one hamil

On graphs uniquely colorable under the a

On graphs uniquely colorable under the action of their automorphism groups

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 166 KB

The uniqueness of a certain graph

✍ Allan Gewirtz; Louis V Quintas 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 394 KB

The Existence of Selfcomplementary Circu

The Existence of Selfcomplementary Circulant Graphs

✍ Dalibor Fronček; Alexander Rosa; Jozef Širáň 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 194 KB

The Existence of Exactlym-Coloured Compl

The Existence of Exactlym-Coloured Complete Subgraphs

✍ Alan Stacey; Peter Weidl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Given a graph G, its edges are said to be exactly x-coloured if we have a surjective map from the edges to some set of colours of size x. Erickson considered the following statement which he denoted P(c, m): if the edges of K | the complete graph on vertex set N are exactly c-coloured, then there ex