Weakly hamiltonian-connected vertices in bipartite tournaments
From MaRDI portal
Publication:1892846
DOI10.1006/jctb.1995.1019zbMath0820.05027MaRDI 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
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey, Alternating cycles and paths in edge-coloured multigraphs: A survey, Weakly Hamiltonian-connected ordinary multipartite tournaments, Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments, Multipartite tournaments: a survey