On a cyclic connectivity property of directed graphs
From MaRDI portal
Publication:2469976
DOI10.1016/J.DISC.2007.03.054zbMATH Open1132.05038OpenAlexW2084743753MaRDI QIDQ2469976FDOQ2469976
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5994590
- Every cycle-connected multipartite tournament has a universal arc
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS
- scientific article; zbMATH DE number 1817715
- Some remarks on Ádám's conjecture for simple directed graphs
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Cycles and paths in bipartite tournaments with spanning configurations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Subtournaments of a Tournament
- On some cyclic connectivity properties of directed graphs (examples and problems)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
- Title not available (Why is that?)
Cited In (10)
- On the cycle polytope of a directed graph and its relaxations
- Universal arcs in local tournaments
- Title not available (Why is that?)
- Universal arcs in tournaments
- Directed cycles with two chords and strong spanning directed subgraphs with few arcs
- The connectivity of directed circulant graphs
- Every cycle-connected multipartite tournament has a universal arc
- Title not available (Why is that?)
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS
- On some cyclic connectivity properties of directed graphs (examples and problems)
This page was built for publication: On a cyclic connectivity property of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469976)
