Recommendations
Cites work
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 4128851 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Entropy bounds for perfect matchings and Hamiltonian cycles
- Graph colouring and the probabilistic method
- Hamilton connected graphs
- Hamiltonian Cycles in Regular Tournaments
- On Hamiltonian bipartite graphs
- On a packing and covering problem
- On the number of Hamiltonian cycles in Dirac graphs
- Random matchings in regular graphs
- Some Theorems on Abstract Graphs
Cited in
(30)- Entropy bounds for perfect matchings and Hamiltonian cycles
- Counting Hamilton cycles in Dirac hypergraphs
- Random directed graphs are robustly Hamiltonian
- Long paths and cycles in random subgraphs of graphs with large minimum degree
- 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
- Dirac type condition and Hamiltonian-connected graphs
- Robust Hamiltonicity of Dirac graphs
- On the number of Hamiltonian cycles in Hamiltonian dense graphs
- Compatible Hamilton cycles in Dirac graphs
- On the number of Hamiltonian cycles in Dirac graphs
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)
