Weakly hamiltonian-connected vertices in bipartite tournaments

DOI10.1006/jctb.1995.1019zbMath0820.05027OpenAlexW2028252114MaRDI QIDQ1892846

Yannis Manoussakis, Jörgen Bang-Jensen

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1019

zbMATH Keywords

tournamentspolynomial algorithmhamiltonian path

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey ⋮ Multipartite tournaments: a survey ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments

This page was built for publication: Weakly hamiltonian-connected vertices in bipartite tournaments