Hamiltonian paths in Cayley graphs (Q1044918)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Hamiltonian paths in Cayley graphs	scientific article

Statements

scholarly article

0 references

Hamiltonian paths in Cayley graphs (English)

0 references

0 references

Radoš Radoičić

0 references

Discrete Mathematics

0 references

publication date

15 December 2009

0 references

zbMATH Keywords

Hamiltonian cycles and paths

0 references

simple groups

0 references

expander graphs

0 references

explicit constructions

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2009.02.018

0 references

Sorting in \(c \log n\) parallel steps

0 references

Random Cayley graphs and expanders

0 references

0 references

Strong bias of group generators: an obstacle to the “product replacement algorithm”

0 references

Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).

0 references

Universal cycles for combinatorial structures

0 references

Tough graphs and Hamiltonian circuits.

0 references

Doubly adjacent gray codes for the symmetric group

0 references

MORE ON GENERATORS FOR ALTERNATING AND SYMMETRIC GROUPS

0 references

Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey

0 references

0 references

0 references

The square of every two-connected graph is Hamiltonian

0 references

0 references

Two-Processor Scheduling with Start-Times and Deadlines

0 references

A Hamilton cycle in the Cayley graph of the \(\langle 2,p,3 \rangle\) presentation of PSL\(_ 2(p)\)

0 references

On finite simple groups of characteristic 2 type

0 references

Some subgroups of SL(3, z) generated by involutions

0 references

0 references

The probability of generating a finite classical group

0 references

0 references

0 references

Sparse pseudo‐random graphs are Hamiltonian

0 references

0 references

Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski

0 references

Ramanujan graphs

0 references

Generation of classical groups

0 references

Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators

0 references

0 references

0 references

Almost all Cayley graphs are hamiltonian

0 references

Generating triples of involutions of Chevalley groups over a finite field of characteristic 2

0 references

Generating triples of involutions of alternating groups

0 references

0 references

0 references

0 references

0 references

0 references

Entropy waves, the zig-zag graph product, and new constant-degree expanders

0 references

Almost all regular graphs are hamiltonian

0 references

On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group

0 references

0 references

0 references

Generation of certain matrix groups by three involutions, two of which commute

0 references

Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface

0 references

Generating triples of involutions of large sporadic groups

0 references

Graph-theoretic properties in computational complexity

0 references

Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

0 references

Expanders that beat the eigenvalue bound

0 references

Cayley digraphs of prime-power order are hamiltonian

0 references

A survey: Hamiltonian cycles in Cayley graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.DISC.2009.02.018

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1044918

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1044918&oldid=38599569"