The following pages link to (Q3266934):
Displaying 50 items.
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- On directed versions of the Corrádi-Hajnal corollary (Q404438) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs (Q477633) (← links)
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li (Q516779) (← links)
- Extending cycles in directed graphs (Q580359) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- A sufficient condition for cyclability in directed graphs (Q878617) (← links)
- Semi-degree threshold for anti-directed Hamiltonian cycles (Q907223) (← links)
- Maximal sets of Hamilton cycles in \(D_n\) (Q932696) (← links)
- \(k\)-Ordered Hamilton cycles in digraphs (Q958680) (← links)
- Cycles of given length in oriented graphs (Q965252) (← links)
- Hamiltonian degree sequences in digraphs (Q974465) (← links)
- On arc-traceable local tournaments (Q998389) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Hamiltonian-connected tournaments (Q1140091) (← links)
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314) (← links)
- On maximal circuits in directed graphs (Q1213883) (← links)
- Développements recents de la théorie des graphes (Q1226996) (← links)
- An Ore-type condition implying a digraph to be pancyclic (Q1239327) (← links)
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) (← links)
- The total chromatic number of regular graphs whose complement is bipartite (Q1318798) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Hamilton cycles in sparse robustly expanding digraphs (Q1671669) (← links)
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114) (← links)
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
- On pancyclic digraphs (Q1844685) (← links)
- Spanning trees of dense directed graphs (Q2132400) (← links)
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs (Q2376100) (← links)
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente (Q2560256) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Random directed graphs are robustly Hamiltonian (Q2820274) (← links)
- Compatible Hamilton cycles in random graphs (Q2830238) (← links)
- Degree sequences forcing Hamilton cycles in directed graphs (Q2851487) (← links)
- A note on some embedding problems for oriented graphs (Q2891043) (← links)
- Arbitrary Orientations of Hamilton Cycles in Digraphs (Q2944460) (← links)
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture (Q4987265) (← links)
- An approximate version of Jackson’s conjecture (Q4993113) (← links)
- Hamiltonicity in random directed graphs is born resilient (Q4993114) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
- Packing and counting arbitrary Hamilton cycles in random digraphs (Q5381053) (← links)
- Flots et tensions dans un graphe (Q5569395) (← links)
- Disjoint Cycles in a Digraph with Partial Degree (Q5883282) (← links)
- Antipaths in oriented graphs (Q6098098) (← links)
- Hamilton cycles in dense regular digraphs and oriented graphs (Q6144396) (← links)
- A new sufficient condition for a 2-strong digraph to be Hamiltonian (Q6606989) (← links)
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices (Q6616149) (← links)
