scientific article; zbMATH DE number 3150485

Cited in

(88)

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

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)