scientific article; zbMATH DE number 3353326
From MaRDI portal
Publication:5628162
Cited in
(20)- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
- A generalization of a theorem of Nash-Williams
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences
- A degree sequence version of the Kühn-Osthus tiling theorem
- Sufficient conditions for a graph to be Hamiltonian
- Vertex-transitive graphs that have no Hamilton decomposition
- Hamiltonian paths in spanning subgraphs of line graphs
- Hamilton decompositions of regular expanders: applications
- On Hamilton's ideals
- Some local-global phenomena in locally finite graphs
- Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
- Vertex arboricity and vertex degrees
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Best monotone degree conditions for graph properties: a survey
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- Cycle partitions of regular graphs
- On forcibly k-connected uniform hypergraphic sequences
- Edge-disjoint Hamilton cycles in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5628162)
