Alternating paths in oriented graphs with large semidegree

DOI10.37236/13084MaRDI QIDQ6901231zbMATH OpenFDO

Authors J. Skokan, Mykhaylo Tyomkyn

Publication date 12 November 2025

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

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites work

• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Antidirected subgraphs of oriented graphs
• Antipaths in oriented graphs
• Arbitrary orientations of Hamilton cycles in oriented graphs
• Hamilton Cycles in Oriented Graphs
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• scientific article; zbMATH DE number 3632516 (Why is no real title available?)
• scientific article; zbMATH DE number 1047732 (Why is no real title available?)
• Long antipaths and anticycles in oriented graphs
• Long paths and cycles in oriented graphs
• On Hamiltonian bipartite graphs
• Oriented hamilton cycles in digraphs
• Oriented trees in digraphs
• Some Theorems on Abstract Graphs
• Tree containment and degree conditions

Cited in

(2)

• Oriented trees in digraphs without oriented 4-cycles
• Unavoidable subgraphs in digraphs with large out-degrees

This page was built for publication: Alternating paths in oriented graphs with large semidegree

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