Hamiltonian-connected tournaments
From MaRDI portal
Publication:1140091
DOI10.1016/0095-8956(80)90061-1zbMath0435.05026OpenAlexW1991927950WikidataQ56503965 ScholiaQ56503965MaRDI QIDQ1140091
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90061-1
Related Items (56)
Universal arcs in tournaments ⋮ Hamiltonian dicycles avoiding prescribed arcs in tournaments ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ On \(d\)-panconnected tournaments with large semidegrees ⋮ Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ t-Pancyclic Arcs in Tournaments ⋮ Bipartitions of highly connected tournaments ⋮ Path-connectivity in local tournaments ⋮ Arc reversals in tournaments ⋮ An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic ⋮ Cycles of all lengths in arc-3-cyclic semicomplete digraphs ⋮ Edge-disjoint in- and out-branchings in tournaments and related path problems ⋮ Bypaths in tournaments ⋮ Trail-connected tournaments ⋮ On king-serf pair in tournaments ⋮ On min-max pair in tournaments ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Spanning eulerian subdigraphs in semicomplete digraphs ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Quasi‐transitive digraphs ⋮ Detours in directed graphs ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ Extremal and Degree Conditions for Path Extendability in Digraphs ⋮ Weakly quasi-Hamiltonian-set-connected multipartite tournaments ⋮ Quasi-hamiltonian paths in semicomplete multipartite digraphs ⋮ On the spanning connectivity of tournaments ⋮ Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments ⋮ Completely strong path-connected tournaments ⋮ Pancyclic out-arcs of a vertex in tournaments ⋮ Cycles of each length in tournaments ⋮ The number of vertices whose out-arcs are pancyclic in a 2-strong tournament ⋮ Multipartite tournaments: a survey ⋮ Strongly 4-path-connectivity in almost regular multipartite tournaments ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Cycles in a tournament with pairwise zero, one or two given vertices in common ⋮ The structure of 4‐strong tournaments containing exactly three out‐arc pancyclic vertices ⋮ On the structure of locally semicomplete digraphs ⋮ On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) ⋮ On the connectivity of close to regular multipartite tournaments ⋮ Out-arc pancyclicity of vertices in tournaments ⋮ Outpaths of arcs in multipartite tournaments ⋮ On 1-factors with prescribed lengths in tournaments ⋮ On arc-traceable local tournaments ⋮ A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture ⋮ The number of out-pancyclic vertices in a strong tournament ⋮ A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Weakly Hamiltonian-connected ordinary multipartite tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ A note on min-max pair in tournaments ⋮ Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments
Cites Work
This page was built for publication: Hamiltonian-connected tournaments
