๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Counterexample to a conjecture on Hamilton cycles

โœ Scribed by P Paulraja

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
65 KB
Volume
64
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

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

A counterexample to a conjecture of gran
A counterexample to a conjecture of grant
โœ Mao-cheng Cai ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 74 KB

We give a counterexample to the following conjecture of Douglas D. Grant Cl]: If a positive integer t 3 2 and D is a strict digraph of order 2t such that S+(D) 3 t and S'(D)2 t, then D has an anti-directed hamiltonian cycle. Where S+(D) and 6-(D) denote the minimum indegree and outdegree, respective