On a cyclic connectivity property of directed graphs

DOI10.1016/j.disc.2007.03.054zbMath1132.05038OpenAlexW2084743753MaRDI QIDQ2469976

Alice Hubenko

Publication date: 11 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.054

zbMATH Keywords

directed graphdirected cyclebitournamentcycle-connectivityuniversal edge

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Universal arcs in tournaments ⋮ Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS ⋮ Universal arcs in local tournaments ⋮ Every cycle-connected multipartite tournament has a universal arc

Cites Work

• Cycles and paths in bipartite tournaments with spanning configurations
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• On Subtournaments of a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a cyclic connectivity property of directed graphs