One-diregular subgraphs in semicomplete multipartite digraphs

DOI<175::AID-JGT5>3.0.CO;2-N 10.1002/(SICI)1097-0118(199702)24:2<175::AID-JGT5>3.0.CO;2-NzbMath0865.05045OpenAlexW2009428600MaRDI QIDQ4333459

Anders Yeo

Publication date: 29 June 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199702)24:2<175::aid-jgt5>3.0.co;2-n

zbMATH Keywords

cycleHamiltonianmultipartite tournamentssemicomplete multipartite digraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian ⋮ Paths and cycles containing given arcs, in close to regular multipartite tournaments ⋮ Longest cycles in almost regular 3-partite tournaments ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ Paths with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ Pancyclic out-arcs of a vertex in oriented graphs ⋮ Complementary cycles in almost regular multipartite tournaments, where one cycle has length four ⋮ Multipartite tournaments: a survey ⋮ Cycles with a given number of vertices from each partite set in regular multipartite tournaments ⋮ On cycles in regular 3-partite tournaments ⋮ Complementary cycles in regular multipartite tournaments, where one cycle has length five ⋮ All regular multipartite tournaments that are cycle complementary ⋮ Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments ⋮ Semicomplete Multipartite Digraphs