## 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
✦ LIBER ✦
A Counterexample to Wegner’s Conjecture on Good Covers
✍ Scribed by Martin Tancer
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 409 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On possible counterexamples to Negami's
✍
Petr Hliněný; Robin Thomas
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 281 KB
On a Minimal Counterexample to Dade's Pr
✍
Charles W. Eaton; Geoffrey R. Robinson
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 96 KB
A counterexample to kippenhahn's conject
✍
Thomas J. Laffey
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 185 KB
Covers in Uniform Intersecting Families
✍
Peter Frankl; Katsuhiro Ota; Norihide Tokushige
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 446 KB
We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu
Counterexample to a conjecture on Hamilt
✍
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.
A counterexample to Seymour's self-minor
✍
Bogdan Oporowski
📂
Article
📅
1990
🏛
John Wiley and Sons
🌐
English
⚖ 212 KB