scientific article; zbMATH DE number 3150485

Cited in

(98)

Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
Hamiltonian dicycles avoiding prescribed arcs in tournaments
Variations on the Gallai-Milgram theorem
Cycles in bipartite tournaments
Degrees and cycles in digraphs
Cycles of each length in tournaments
On multipartite tournaments
A linear-time algorithm for finding Hamiltonian cycles in tournaments
On cycles through a given vertex in multipartite tournaments
Bypaths in tournaments
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Disjoint cycles of different lengths in graphs and digraphs
On the spanning connectivity of tournaments
Stable set meeting every longest path
Cycles and paths in bipartite tournaments with spanning configurations
Diperfect graphs
Oriented Hamiltonian cycles in tournaments
Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
Vertex 6-pancyclic in-tournaments
Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
Arc-pancyclicity of hypertournaments with irregularity at most two
Non-separating spanning trees and out-branchings in digraphs of independence number 2
\(\alpha\)-diperfect digraphs
On disjoint cycles of the same length in tournaments
Lichiardopol's conjecture on disjoint cycles in tournaments
Polynomial stability and potentially stable patterns
Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
On 1-factors with prescribed lengths in tournaments
About the number of directed paths in tournaments
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
The energy of the alphabet model
Berge's conjecture on directed path partitions -- a survey
Paths with a given number of vertices from each partite set in regular multipartite tournaments
On the vertex-pancyclicity of hypertournaments
The number of vertices whose out-arcs are pancyclic in a 2-strong tournament
Multipartite tournaments: a survey
On a cyclic connectivity property of directed graphs
A remark on cycles through an arc in strongly connected multipartite tournaments
Cycles in a tournament with pairwise zero, one or two given vertices in common
All 2-connected in-tournaments that are cycle complementary
Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Trail-connected tournaments
Packing strong subgraph in digraphs
Dicycle cover of Hamiltonian oriented graphs
Regular Hypertournaments and Arc-Pancyclicity
Tournaments and Semicomplete Digraphs
Semicomplete Multipartite Digraphs
On pancyclic arcs in hypertournaments
Surjective \texttt{H}-colouring over reflexive digraphs
Cycles with a given number of vertices from each partite set in regular multipartite tournaments
Path Partitions, Cycle Covers and Integer Decomposition
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
A survey on Hamilton cycles in directed graphs
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices
The watchman's walk problem on directed graphs
scientific article; zbMATH DE number 7641244 (Why is no real title available?)
Shortcutting directed and undirected networks with a degree constraint
Notes on weak-odd edge colorings of digraphs
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
Sublinear-Time Algorithms for Tournament Graphs
scientific article; zbMATH DE number 3293648 (Why is no real title available?)
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
Spanning eulerian subdigraphs in semicomplete digraphs
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments
The iterated local transitivity model for tournaments
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
Two‐stage majoritarian choice
Complementary cycles of any length in regular bipartite tournaments
Spanning 3-strong tournaments in 5-strong semicomplete digraphs
About the number of oriented Hamiltonian paths and cycles in tournaments
Cycles through arcs in multipartite tournaments and a conjecture of Volkmann
Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs
Sublinear-time algorithms for tournament graphs
Vertex degree sums for supereulerian bipartite digraphs
Positive vectors, pairwise comparison matrices and directed Hamiltonian cycles
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
Paths with two blocks in oriented graphs of large minimum semi-degree
Hamiltonian cycles avoiding a spanning forest or a spanning cycle subgraph in tournaments
On the minimum number of inversions to make a digraph k-(arc-)strong
Generalized paths and cycles in semicomplete multipartite digraphs
Non-Hamiltonian cycles in tournaments
A proof to Bang-Jensen, Havet and Yeo's conjecture on the Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
Hamiltonian tournaments and Gorenstein rings
Oriented Hamiltonian paths in tournaments with an arc removed
A new perspective from hypertournaments to tournaments
Out-arc pancyclicity of vertices in tournaments
New algorithms and lower bounds for streaming tournaments
Anti-pancyclic arcs in strong tournaments
The number of out-pancyclic vertices in a strong tournament
Parameterized complexity of d-hitting set with quotas
An s-strong tournament with s 3 has s+1 vertices whose out-arcs are 4-pancyclic
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
Cycle factors in strongly connected local tournaments
On arc-traceable local tournaments

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3267901)