scientific article; zbMATH DE number 1286511
From MaRDI portal
Publication:4242960
Recommendations
Cited in
(43)- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Square Hamiltonian cycles in graphs with maximal 4-cliques
- Optimal and pessimal orderings of Steiner triple systems in disk arrays.
- Random perturbation of sparse graphs
- Monochromatic square-cycle and square-path partitions
- Spectral radius and the 2-power of Hamilton cycle
- Powers of Hamilton cycles of high discrepancy are unavoidable
- Minimum degree conditions for monochromatic cycle partitioning
- On the relation of separability, bandwidth and embedding
- Monochromatic cycle power partitions
- On resilience of connectivity in the evolution of random graphs
- Large planar subgraphs in dense graphs
- Triangle resilience of the square of a Hamilton cycle in random graphs
- Compatible Hamilton cycles in random graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- A note on powers of Hamilton cycles in generalized claw-free graphs
- Hamiltonian cycles with all small even chords
- Monochromatic bounded degree subgraph partitions
- Minimum Degrees for Powers of Paths and Cycles
- A rainbow blow-up lemma
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- An extension of the blow-up lemma to arrangeable graphs
- Pósa's conjecture for graphs of order at least 2 × 108
- Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles
- High powers of Hamiltonian cycles in randomly augmented graphs
- Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Minimum degree conditions for powers of cycles and paths
- On powers of Hamilton cycles in Ramsey-Turán theory
- Spanning subdivisions in Dirac graphs
- Compatible powers of Hamilton cycles in dense graphs
- Compatible Hamilton cycles in Dirac graphs
- Blowing up Dirac's theorem
- Counting spanning subgraphs in dense hypergraphs
- Packing of the k-power of Hamilton cycles
- Dirac's theorem for linear hypergraphs
- Variants of Baranyai's theorem with additional conditions
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- On 2-factors with \(k\) components
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Distributing vertices along a Hamiltonian cycle in Dirac 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 Q4242960)
