scientific article; zbMATH DE number 3801730
From MaRDI portal
Publication:4745951
Cited in
(12)- Randomly colouring graphs (a combinatorial view)
- Counting and packing Hamilton cycles in dense graphs and oriented graphs
- Some results towards the Dittert conjecture on permanents
- Improved upper bounds on even-cycle creating Hamilton paths
- Enumerating coprime permutations
- Approximate Hamilton decompositions of random graphs
- The minimum number of spanning trees in regular multigraphs
- Extremal positive semidefinite doubly stochastic matrices
- Number of 1-factorizations of regular high-degree graphs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Matching theory -- a sampler: From Dénes König to the present
- Edge-disjoint Hamilton cycles in random 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 Q4745951)