Long cycles in vertex-transitive graphs
From MaRDI portal
Publication:3048869
DOI10.1002/JGT.3190030314zbMATH Open0414.05032OpenAlexW2151112199MaRDI QIDQ3048869FDOQ3048869
Authors: László Babai
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030314
Cites Work
Cited In (13)
- The antipodal layers problem
- Monotone Gray codes and the middle levels problem
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- Hamiltonicity of covering graphs of trees
- On the Intersections of Longest Cycles in a Graph
- Hamilton cycles in dense vertex-transitive graphs
- An update on the middle levels problem
- Probabilistic computability and choice
- Hamilton cycles in pseudorandom graphs
- Intersecting balanced families of sets
- Intersections of longest cycles in \(k\)-connected graphs
- Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
This page was built for publication: Long cycles in vertex-transitive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048869)