Skip to main content
Log in

Minimal k-Connected Non-Hamiltonian Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, we explore minimal k-connected non-Hamiltonian graphs. Graphs are said to be minimal in the context of some containment relation; we focus on subgraphs, induced subgraphs, minors, and induced minors. When \(k=2\), we discuss all minimal 2-connected non-Hamiltonian graphs for each of these four relations. When \(k=3\), we conjecture a set of minimal non-Hamiltonian graphs for the minor relation and we prove one case of this conjecture. In particular, we prove all 3-connected planar triangulations which do not contain the Herschel graph as a minor are Hamiltonian.

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
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Similar content being viewed by others

References

  1. Brinkmann, G., Larson, C., Souffriau, J., Van Cleemput, N.: Construction of planar \(4\)-connected triangulations. Ars Math. Contemp. 9, 145–149 (2015)

    MathSciNet  MATH  Google Scholar 

  2. Brousek, Jan: Minimal \(2\)-connected non-hamiltonian claw-free graphs. Discret. Math. 191, 57–64 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, Guantao, Xingxing, Yu., Zang, Wenan: The circumference of a graph with no \(K_{3, t}\)-minor, II. J. Comb. Theory Ser. B 102(6), 1211–1240 (2012)

    Article  MATH  Google Scholar 

  4. Chvátal, V., Erdős, P.: A note on Hamiltonian circuits. Discret. Math. 2(2), 111–113 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  5. Mark, E., Emily M., Kenta, O., Shoichi, T.: Hamiltonicity of planar graphs with a forbidden minor, Submitted for publication, (October 2016). arXiv:1610.06558

  6. Jackson, B., Xingxing, Y.: Hamilton cycles in plane triangulations. J. Graph Theory 42(2), 138–150 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kotzig, A.: Regularly connected trivalent graphs without non-trivial cuts of cardinality 3, Acta Fac. Rerum Natur. Univ. Comenian. Math. 21, 1–14 (1968)

    MathSciNet  MATH  Google Scholar 

  8. Robertson, N., Seymour, P.: Graph minors IX: disjoint crossed paths. J. Comb. Theory Ser. B 49, 40–77 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory Ser. B 28, 305–359 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99–116 (1956)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Emily Marshall.

Additional information

The first author was supported in part by NSF Grant DMS-1500699.

The work for this paper was largely done while the second author was at Louisiana State University.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ding, G., Marshall, E. Minimal k-Connected Non-Hamiltonian Graphs. Graphs and Combinatorics 34, 289–312 (2018). https://doi.org/10.1007/s00373-018-1874-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-018-1874-z

Keywords

Navigation