✦ LIBER ✦

Graphs with unique Ramsey colorings

✍ Scribed by Jerrold W. Grossman

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 313 KB
Volume: 7
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190070111

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian weights and unique 3-edge-co

Hamiltonian weights and unique 3-edge-colorings of cubic graphs

✍ Cun-Quan Zhang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract A (1,2)‐eulerian weight __w__ of a grph is hamiltonian if every faithful cover of __w__ is a set of two Hamilton circuits. Let __G__ be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if __G__ admits a hamiltonian weight then __G__ is uniquely 3‐

Kr-Free Uniquely Vertex Colorable Graphs

Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges

✍ S. Akbari; V.S. Mirrokni; B.S. Sadjad 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

We construct counterexamples to the conjecture of Xu (1990, J. Combin. Theory Ser. B 50, 319 320) that every uniquely r-colorable graph of order n with exactly (r&1) n&( r2 ) edges must contain a K r . ## 2001 Academic Press Harary et al. [4] constructed uniquely r-colorable graphs containing no

On graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

On graphs with small Ramsey numbers

✍ A. V. Kostochka; V. Rödl 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __R__(__G__) denote the minimum integer __N__ such that for every bicoloring of the edges of __K~N~__, at least one of the monochromatic subgraphs contains __G__ as a subgraph. We show that for every positive integer __d__ and each γ,0 < γ < 1, there exists __k__ = __k__(__d__,γ) su

Graphs with Linearly Bounded Ramsey Numb

Graphs with Linearly Bounded Ramsey Numbers

✍ G.T. Chen; R.H. Schelp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A graph \(G\) of order \(n\) is \(p\)-arrangeable if its vertices can be ordered as \(v_{1}, v_{2}, \ldots, v_{n}\) such that \(\left|N_{L_{i}}\left(N_{R_{i}}\left(v_{i}\right)\right)\right| \leqslant p\) for each \(1 \leqslant i \leqslant n-1\), where \(L_{i}=\left\{v_{1}, v_{2}, \ldots, v_{i}\righ

Graphs with unique maximal clumpings

✍ Andreas Blass 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

## Abstract A partition of the vertices of a graph is called a clumping if, for vertices in distinct partition classes, adjacency depends only on the partition classes, not on the specific vertices. We give a simple necessary and sufficient condition for a finite graph to have a unique maximal clum