scientific article; zbMATH DE number 3149611

Cited in

(71)

Triangle packings and 1-factors in oriented graphs
Hamiltonian-connected tournaments
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
On maximal circuits in directed graphs
Développements recents de la théorie des graphes
An Ore-type condition implying a digraph to be pancyclic
Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
The total chromatic number of regular graphs whose complement is bipartite
Alternating cycles and paths in edge-coloured multigraphs: A survey
Hamilton cycles in sparse robustly expanding digraphs
Sufficient conditions for a balanced bipartite digraph to be even pancyclic
Sufficient conditions for Hamiltonian cycles in bipartite digraphs
On pancyclic digraphs
Spanning trees of dense directed graphs
Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
Spanning trees in dense directed graphs
Random directed graphs are robustly Hamiltonian
Compatible Hamilton cycles in random graphs
Degree sequences forcing Hamilton cycles in directed graphs
A note on some embedding problems for oriented graphs
Arbitrary orientations of Hamilton cycles in digraphs
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
On directed versions of the Corrádi-Hajnal corollary
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
A survey on Hamilton cycles in directed graphs
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
An approximate version of Jackson's conjecture
Hamiltonicity in random directed graphs is born resilient
On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
On the size of maximally non-Hamiltonian digraphs
An extension of the Hajnal-Szemerédi theorem to directed graphs
Packing and counting arbitrary Hamilton cycles in random digraphs
Flots et tensions dans un graphe
Extending cycles in directed graphs
Disjoint Cycles in a Digraph with Partial Degree
scientific article; zbMATH DE number 7746259 (Why is no real title available?)
Antipaths in oriented graphs
Hamilton cycles in dense regular digraphs and oriented graphs
A new sufficient condition for a 2-strong digraph to be Hamiltonian
Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
On oriented cycles in randomly perturbed digraphs
Spanning subdivisions in dense digraphs
A note between transitive C₄-factor and oriented Ramsey number
Cycles and trees in randomly perturbed sparse digraphs
Paths with two blocks in oriented graphs of large minimum semi-degree
How many random edges make an almost-Dirac graph Hamiltonian?
Recent results on the total chromatic number
Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
Alternating paths in oriented graphs with large semidegree
On Hamiltonian bypasses in orgraphs with large semi-degrees
A generalization of the Hamiltonian cycle in dense digraphs
On three conjectures of Thomassen and the extremal digraphs for two conjectures of Nash-Williams
Rainbow directed version of Dirac's theorem
Random partitions and edge-disjoint Hamiltonian cycles
Cycle partitions in dense regular digraphs and oriented graphs
Cycle partition of dense regular digraphs and oriented graphs (extended abstract)
Cycles of every length and orientation in randomly perturbed digraphs (extended abstract)
Long antipaths and anticycles in oriented graphs
Edge-disjoint Hamilton cycles in graphs
Cyclic subsets of tournaments
Randomly perturbed digraphs also have bounded-degree spanning trees
Transversal Hamilton paths and cycles
A sufficient condition for cyclability in directed graphs
Semi-degree threshold for anti-directed Hamiltonian cycles
Maximal sets of Hamilton cycles in \(D_n\)
\(k\)-Ordered Hamilton cycles in digraphs
Cycles of given length in oriented graphs
Hamiltonian degree sequences in digraphs
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 Q3266934)