Hamilton powers of Eulerian digraphs

DOI10.37236/11905zbMATH Open1543.05064MaRDI QIDQ6574398

John C. Urschel, Enrico Celestino Colón

Publication date: 18 July 2024

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

zbMATH Keywords

acyclic digraphEuler circuit

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on Hamilton cycles in directed graphs
• A short proof of Fleischner's theorem
• On minimal Eulerian graphs
• Remarks on Hamiltonian properties of powers of digraphs
• An upper bound for the Hamiltonicity exponent of finite 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
• On the Cube of a Graph

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)