๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hamiltonian circuits in polytopes with even sided faces

โœ Scribed by P. R. Goodey

Book ID
112884480
Publisher
The Hebrew University Magnes Press
Year
1975
Tongue
English
Weight
167 KB
Volume
22
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Three-Coloring Graphs Embedded on Surfac
Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided
โœ J.P. Hutchinson ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 765 KB

Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result. 1995 Academic Press. Inc.

Hamiltonian circuits and paths in subset
Hamiltonian circuits and paths in subset graphs with circular adjacency
โœ T.C. Enns ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 751 KB

Consider the subset graph G(n, k) whose vertex set C(n, k) is the set of all n-tuples of 'O's' and 'l's' with exactly k 'I's'. Let an edge exist between two vertices a and b in G(n,k) if and only if a can be transformed into b by the interchange of two adjacent coordinate values, with the first and