Dirac's theorem for graphs of bounded bandwidth

DOI10.37236/13474MaRDI QIDQ6864188zbMATH OpenFDO

Authors Alberto Espuny Díaz, Pranshu Gupta, Domenico Mergoni Cecchelli, O. Parczyk

Publication date 4 February 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13474

zbMATH Keywords

greedy algorithmHamilton pathsrandom geometric graph model

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A bandwidth theorem for approximate decompositions
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• A survey on Hamilton cycles in directed graphs
• Advances on the Hamiltonian problem -- a survey
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Embedding large subgraphs into dense graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• Local resilience of graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Recent advances on Dirac-type problems for hypergraphs
• Recent advances on the Hamiltonian problem: survey III
• Some Theorems on Abstract Graphs
• Spanning subdivisions in dense digraphs
• Spanning subdivisions in Dirac graphs
• The bandwidth problem for graphs and matrices—a survey
• The bandwidth theorem in sparse graphs
• Updating the hamiltonian problem—A survey

This page was built for publication: Dirac's theorem for graphs of bounded bandwidth

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