Skip to main content
Log in

On Barnette’s conjecture and the \(H^{+-}\) property

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Let \(\mathcal{B}\) denote the class of all 3-connected cubic bipartite plane graphs. A conjecture of Barnette states that every graph in \(\mathcal{B}\) has a Hamilton cycle. A cyclic sequence of big faces is a cyclic sequence of different faces, each bounded by at least six edges, such that two faces from the sequence are adjacent if and only if they are consecutive in the sequence. Suppose that \({F_1, F_2, F_3}\) is a proper 3-coloring of the faces of \(G^*\in \mathcal{B}\). We prove that if every cyclic sequence of big faces of \(G^*\) has a face belonging to \(F_1\) and a face belonging to \(F_2\), then \(G^*\) has the following properties: \(H^{+-}\): If any two edges are chosen on the same face, then there is a Hamilton cycle through one and avoiding the other, \(H^{--}\): If any two edges are chosen which are an even distance apart on the same face, then there is a Hamilton cycle that avoids both. Moreover, let \(X\) and \(Y\) partition the set of big faces of \(G^*\) such that all such faces of \(F_1\) are in \(X\) and all such faces of \(F_2\) are in \(Y\). We prove that if every cyclic sequence of big faces has a face belonging to \(X\) and a face belonging to \(Y\), then \(G^*\) has a Hamilton cycle.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Alt H, Payne MS, Schmidt JM, Wood DR (2013) Thoughts on Barnette’s conjecture. arXiv: 1312.3783 [math.CO]

  • Bondy JA, Murty USR (2008) Graph theory, graduate texts in Mathematics, vol 244. Springer, New York

    MATH  Google Scholar 

  • Chang GJ, Chen C, Chen Y (2004) Vertex and tree arboricities of graphs. J Comb Optim 8:1531–1535

    Article  MathSciNet  MATH  Google Scholar 

  • Feder T, Subi C (2006) On Barnette’s conjecture, ECCC, Report No. 15

  • Florek J (2010) On Barnette’s conjecture. Discret Math 310:1531–1535

    Article  MathSciNet  MATH  Google Scholar 

  • Goodey PR (1975) Hamiltonian cycles in polytopes with even sides. Israel J Math 22:52–56

    Article  MathSciNet  MATH  Google Scholar 

  • Heawood PJ (1898) On the four-colour map theorem. Quart J Pure Appl Math 24:270–285

    MATH  Google Scholar 

  • Holton DA, Manvel B, McKay BD (1985) Hamiltonian cycles in cubic 3-connected bipartite planar graphs. J Combin Theor B 38:279–297

    Article  MathSciNet  MATH  Google Scholar 

  • Kelmans AK (1986) Constructions of cubic bipartite 3-connected graphs without Hamiltonian cycles, Analiz Zadach Formirovaniya i Vybora Alternativ, VNIISI, Moscov 10:64–72. (in Russian); (1994) AMS Transl Ser 2, 158:127–140

  • Skupień Z (2002) Hamiltonicity of planar cubic multigraphs. Discret Math 251:163–168

    Article  MathSciNet  MATH  Google Scholar 

  • Stein SK (1971) B-sets and planar maps. Pac J Math 37:217–224

    Article  MathSciNet  MATH  Google Scholar 

  • Tutte WT (ed) (1969) Recent progress in combinatorics. Academic Press, New York

    MATH  Google Scholar 

Download references

Acknowledgments

The author is very grateful to an anonymous referee for the very detailed remarks which helped to improve the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jan Florek.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Florek, J. On Barnette’s conjecture and the \(H^{+-}\) property. J Comb Optim 31, 943–960 (2016). https://doi.org/10.1007/s10878-014-9797-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9797-y

Keywords

Mathematics Subject Classification

Navigation