Hamiltonian cycles in Dirac graphs

DOI10.1007/S00493-009-2360-2zbMATH Open1212.05146OpenAlexW1965652541MaRDI QIDQ987558FDOQ987558

Authors: Bill Cuckler, J. Kahn 

Publication date: 13 August 2010

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-2360-2

Recommendations

• On the number of Hamiltonian cycles in Dirac graphs
• Compatible Hamilton cycles in Dirac graphs
• Counting Hamilton cycles in Dirac hypergraphs
• On the number of Hamiltonian cycles in Hamiltonian dense graphs
• Robust Hamiltonicity of Dirac graphs

zbMATH Keywords

Hamiltonian cyclesDirac graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30)

Cites Work

• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
• Title not available (Why is that?)
• On a packing and covering problem
• Some Theorems on Abstract Graphs
• Graph colouring and the probabilistic method
• A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Hamiltonian bipartite graphs
• On the number of Hamiltonian cycles in Dirac graphs
• Hamiltonian Cycles in Regular Tournaments
• Entropy bounds for perfect matchings and Hamiltonian cycles
• Title not available (Why is that?)
• Random matchings in regular graphs
• Hamilton connected graphs

Cited In (30)

• Entropy bounds for perfect matchings and Hamiltonian cycles
• Long paths and cycles in random subgraphs of graphs with large minimum degree
• Random directed graphs are robustly Hamiltonian
• From one to many rainbow Hamiltonian cycles
• Counting oriented trees in digraphs with large minimum semidegree
• Recent advances on the Hamiltonian problem: survey III
• On prisms, Möbius ladders and the cycle space of dense graphs
• The number of bounded‐degree spanning trees
• Chvátal-Erdős condition for pancyclicity
• Optimal spread for spanning subgraphs of Dirac hypergraphs
• Compatible Hamilton cycles in random graphs
• A robust Corrádi-Hajnal theorem
• Hamilton cycles in pseudorandom graphs
• Counting and packing Hamilton cycles in dense graphs and oriented graphs
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Packing, counting and covering Hamilton cycles in random directed graphs
• Packing, counting and covering Hamilton cycles in random directed graphs
• Compatible powers of Hamilton cycles in dense graphs
• The number of Hamiltonian decompositions of regular graphs
• Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
• Interview with Benny Sudakov
• Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
• An implicit degree Dirac condition for Hamiltonian cycles.
• Threshold Ramsey multiplicity for paths and even cycles
• Robust Hamiltonicity of Dirac graphs
• Dirac type condition and Hamiltonian-connected graphs
• On the number of Hamiltonian cycles in Hamiltonian dense graphs
• On the number of Hamiltonian cycles in Dirac graphs
• Compatible Hamilton cycles in Dirac graphs
• Counting Hamilton cycles in Dirac hypergraphs

This page was built for publication: Hamiltonian cycles in Dirac graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987558)