On prisms, Möbius ladders and the cycle space of dense graphs
From MaRDI portal
Publication:2441654
DOI10.1016/j.ejc.2013.09.005zbMath1284.05146arXiv1112.5101MaRDI QIDQ2441654
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.5101
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integral quartic Cayley graphs on Abelian groups
- On infinite cycles. I, II
- Entropy bounds for perfect matchings and Hamiltonian cycles
- The homology of a locally finite graph with ends
- Cycle decompositions: from graphs to continua
- Edge-disjoint Hamilton cycles in graphs
- A basis for the cycle space of a 2-connected graph
- Hamilton connected graphs
- The Hamilton spaces of Cayley graphs on abelian groups
- On two Hamilton cycle problems in random graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Hamiltonian cycles in Dirac graphs
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Long cycles generate the cycle space of a graph
- A generalization of Dirac's theorem
- A method in graph theory
- Hamiltonian paths and hamiltonian connectivity in graphs
- The cycle space of a 3-connected Hamiltonian graph
- House of Graphs: a database of interesting graphs
- 2-factors in dense bipartite graphs
- On the number of Hamiltonian cycles in Dirac graphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Hamilton decompositions of regular expanders: applications
- 6-path-connectivity and 6-generation
- Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
- Embedding into Bipartite Graphs
- Approximate Hamilton decompositions of random graphs
- Dirac's theorem for random graphs
- A new planarity criterion for 3-connected graphs
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- Hamilton paths in Cayley graphs on generalized dihedral groups
- Hamilton Cycles in Planar Locally Finite Graphs
- Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
- The Cycle Space of an Infinite Graph
- How many random edges make a dense graph hamiltonian?
- On the square of a Hamiltonian cycle in dense graphs
- Optimal Packings of Hamilton Cycles in Sparse Random Graphs
- On extendability of Cayley graphs
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
- Edge-disjoint Hamilton cycles in random graphs
- Pósa's conjecture for graphs of order at least 2 × 108
- On the Möbius Ladders
- How to Draw a Graph
- Some Theorems on Abstract Graphs
- Hamilton-connected Cayley graphs on Hamiltonian groups
