A note on K4-closures in hamiltonian graph theory
β Scribed by H.J. Broersma
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 310 KB
- Volume
- 121
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We introduce and start the study of a bialgebra of graphs, which we call the 4-bialgebra, and of the dual bialgebra of 4-invariants. The 4-bialgebra is similar to the ring of graphs introduced by W. T. Tutte in 1946, but its structure is more complicated. The roots of the definition are in low dimen
## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__βvertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ β₯ 12. We also pro
## Abstract Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloβFraenkel Set Theory, CZF. It is shown that CZF augmented by decidable Bar Induction proves the 1βconsistency of CZF. This answ