𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One counterexample for two conjectures on three coloring

✍ Scribed by L.S. Mel'nikov; Richard Steinberg

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
267 KB
Volume
20
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Counterexample to a conjecture on Hamilt
Counterexample to a conjecture on Hamilton cycles
✍ P Paulraja πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 65 KB

We disprove the following conjecture: Let G be a 2-connected graph with minimum degree n on atmost 3n -2 vertices. Then G is hamiltonian if it has a 2-factor.

On possible counterexamples to Negami's
On possible counterexamples to Negami's planar cover conjecture
✍ Petr HlinΔ›nΓ½; Robin Thomas πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 281 KB

## Abstract A simple graph **__H__** is a cover of a graph **__G__** if there exists a mapping Ο† from **__H__** onto **__G__** such that Ο† maps the neighbors of every vertex Ο… in **__H__** bijectively to the neighbors of Ο† (Ο…) in **__G__**. Negami conjectured in 1986 that a connected graph has a fi