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 a counterexample to a conjecture of Mirzaian
โ Scribed by Masatsugu Urabe; Mamoru Watanabe
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 128 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0925-7721
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The Saint Venant's conjecture for convex plane domains f~, having symmetry about two orthogonal axes, is that the maximum of [Vu[ occurs only at the points on df~ which are nearest to the origin. G. Sweers constructed one such domain f~ and claimed that either the conjecture fails for f~ or for f~ =
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