Non-hamiltonian 4/5-tough maximal planar graphs

@article{Harant1995Nonhamiltonian4M,
  title={Non-hamiltonian 4/5-tough maximal planar graphs},
  author={Jochen Harant and Peter J. Owens},
  journal={Discret. Math.},
  year={1995},
  volume={147},
  pages={301-305}
}

Figures and Tables from this paper

More than one tough chordal planar graphs are Hamiltonian
TLDR
It is proved that for any " > 0 there is a 1-tough chordal planar graph G " such that the length of a longest cycles of G " is less than "jV (G)j".
An update on non-Hamiltonian 54-tough maximal planar graphs
An update on non-Hamiltonian $\frac{5}{4}$-tough maximal planar graphs
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of $\frac{5}{4}$-tough maximal planar graphs presented by Harant
The Relation Between Hamiltonian and 1-Tough Properties of the Cartesian Product Graphs
TLDR
The relation between Hamiltonicity and toughness of a graph is a long standing research problem and it is shown that the following three statements are equivalent: (i) P_n\square H is Hamiltonian; (ii) H is-tough; and (iii) $H$ has a path factor.
Toughness in Graphs – A Survey
TLDR
This survey has attempted to bring together most of the results and papers that deal with toughness related to cycle structure into a few self explanatory categories.
Separating 3-cycles in plane triangulations
Toughness in Graph s-AS urvey
In this survey we have attempted to bring together most of the results and papers that deal with toughness related to cycle structure. We begin with a brief introduction and a section on terminology
Shortness parameters for polyhedral graphs
...
...

References

SHOWING 1-6 OF 6 REFERENCES
A 1-tough nonhamiltonian maximal planar graph
An upper bound on the shortness exponent of 1-tough, maximal planar graphs
Tough graphs and hamiltonian circuits
Shortness Exponents of Families of Graphs
A Theorem on Graphs
Shortness expotients of families of graphs
  • J. Combin. Theory
  • 1973