Paths and cycles containing given arcs, in close to regular multipartite tournaments
From MaRDI portal
Publication:2384804
DOI10.1016/J.JCTB.2007.02.004zbMATH Open1124.05053OpenAlexW2028411861MaRDI QIDQ2384804FDOQ2384804
Authors: A. Yeo
Publication date: 10 October 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.02.004
Recommendations
- scientific article; zbMATH DE number 2222004
- scientific article; zbMATH DE number 2147930
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
- scientific article; zbMATH DE number 2197943
Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)
Cites Work
- Cycles in multipartite tournaments: Results and problems
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Kings in semicomplete multipartite digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-diregular subgraphs in semicomplete multipartite digraphs
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Title not available (Why is that?)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- Title not available (Why is that?)
Cited In (18)
- How close to regular must a multipartite tournament be to secure a given path covering number?
- Title not available (Why is that?)
- Strong subtournaments and cycles of multipartite tournaments
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments
- Outpaths of arcs in multipartite tournaments
- A sufficient condition for a regular 4-partite tournament to be pancyclic
- Multipartite tournaments: a survey
- Pancyclic out-arcs of a vertex in oriented graphs
- Vertex-pancyclism in the generalized sum of digraphs
- Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
- How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
- Cycle extendability in extended tournaments
- Semicomplete Multipartite Digraphs
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- On \(d\)-panconnected tournaments with large semidegrees
This page was built for publication: Paths and cycles containing given arcs, in close to regular multipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384804)