𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


On a Hopf Algebra in Graph Theory
✍ Sergei K. Lando πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 230 KB

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

On the number of hamiltonian cycles in a
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 2 views

## 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

A note on Bar Induction in Constructive
✍ Michael Rathjen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## 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