Hamilton powers of Eulerian digraphs

DOI10.37236/11905MaRDI QIDQ6574398zbMATH OpenFDO

Authors Enrico Celestino Colón, John C. Urschel

Publication date 18 July 2024

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

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

zbMATH Keywords

acyclic digraphEuler circuit

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• On Hamiltonian powers of digraphs
• An upper bound for the Hamiltonicity exponent of finite digraphs
• Hamiltonicity exponent of digraphs
• scientific article; zbMATH DE number 1536526
• Remarks on Hamiltonian properties of powers of digraphs

Cites work

• A short proof of Fleischner's theorem
• A survey on Hamilton cycles in directed graphs
• An upper bound for the Hamiltonicity exponent of finite digraphs
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3192675 (Why is no real title available?)
• On minimal Eulerian graphs
• On the Cube of a Graph
• Remarks on Hamiltonian properties of powers of digraphs
• The square of every two-connected graph is Hamiltonian
• The Traveling Salesman Problem with Many Visits to Few Cities
• To Prove and Conjecture: Paul Erdos and His Mathematics

This page was built for publication: Hamilton powers of Eulerian digraphs

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