𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counterexample to kippenhahn's conjecture on hermitian pencils

✍ Scribed by Thomas J. Laffey

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
185 KB
Volume
51
Category
Article
ISSN
0024-3795

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

A counterexample to the bold conjecture
A counterexample to the bold conjecture
✍ Sakuma, Tadashi πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

A pair of vertices (x, y) of a graph G is an Ο‰-critical pair if Ο‰(G + xy) > Ο‰(G), where G + xy denotes the graph obtained by adding the edge xy to G and Ο‰(H) is the clique number of H. The Ο‰-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee