<--- Back to Details
First PageDocument Content
Cayley graph / Vertex-transitive graph / Symmetric graph / Coxeter graph / Graph / Möbius–Kantor graph / Hamiltonian path / Neighbourhood / Connectivity / Graph theory / Algebraic graph theory / Petersen graph
Date: 2008-02-01 19:58:17
Cayley graph
Vertex-transitive graph
Symmetric graph
Coxeter graph
Graph
Möbius–Kantor graph
Hamiltonian path
Neighbourhood
Connectivity
Graph theory
Algebraic graph theory
Petersen graph

HAMILTONICITY OF CUBIC CAYLEY GRAPHS ˇ Dragan Maruˇ sic

Add to Reading List

Source URL: arxiv.org

Download Document from Source Website

File Size: 251,41 KB

Share Document on Facebook

Similar Documents

Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut

DocID: 1uGjC - View Document

Mathematics / Academia / Leonhard Euler / Hamiltonian path / Magic square / Euler / Chess / Mathematical chess problem / Euler characteristic

How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

DocID: 1rkKa - View Document

Graph theory / Mathematics / Bioinformatics / NP-complete problems / Computational biology / DNA sequencing / K-mer / Velvet assembler / Eulerian path / Hamiltonian path / Degree / Seven Bridges of Knigsberg

How to apply de Bruijn graphs to genome assembly

DocID: 1rgGj - View Document

Cryptography / Graph theory / Mathematics / NP-complete problems / Zero-knowledge proof / Algebraic graph theory / Commitment scheme / Hamiltonian path problem / Hamiltonian path / Proof of knowledge / Adjacency matrix / NP

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rauh - View Document

Graph theory / Kneser graph / Petersen graph / Odd graph / Hamiltonian path / Graph / Cycle / Planar graphs / Desargues graph / Polyhedral graph

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

DocID: 1r5gC - View Document