scientific article
From MaRDI portal
Publication:3266934
zbMath0091.37503MaRDI QIDQ3266934
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Disjoint Cycles in a Digraph with Partial Degree, A note on some embedding problems for oriented graphs, Spanning trees of dense directed graphs, Flots et tensions dans un graphe, Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture, Hamilton cycles in sparse robustly expanding digraphs, A sufficient condition for cyclability in directed graphs, Arbitrary Orientations of Hamilton Cycles in Digraphs, Spanning trees in dense directed graphs, Hamiltonian-connected tournaments, On directed versions of the Corrádi-Hajnal corollary, Antipaths in oriented graphs, A sufficient condition for the existence of an anti-directed 2-factor in a directed graph, A survey on Hamilton cycles in directed graphs, Hamilton cycles in dense regular digraphs and oriented graphs, Sufficient conditions for a balanced bipartite digraph to be even pancyclic, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, Semi-degree threshold for anti-directed Hamiltonian cycles, Unnamed Item, Packing and counting arbitrary Hamilton cycles in random digraphs, Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs, Maximal sets of Hamilton cycles in \(D_n\), Sufficient conditions for Hamiltonian cycles in bipartite digraphs, Alternating Hamiltonian circuits in edge-coloured bipartite graphs, On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li, Recent results on the total chromatic number, \(k\)-Ordered Hamilton cycles in digraphs, Cycles of given length in oriented graphs, On maximal circuits in directed graphs, Hamiltonian degree sequences in digraphs, Développements recents de la théorie des graphes, Edge-disjoint Hamilton cycles in graphs, Extending cycles in directed graphs, An Ore-type condition implying a digraph to be pancyclic, On arc-traceable local tournaments, Random directed graphs are robustly Hamiltonian, On the size of maximally non-hamiltonian digraphs, Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem, Triangle packings and 1-factors in oriented graphs, Compatible Hamilton cycles in random graphs, An approximate version of Jackson’s conjecture, Hamiltonicity in random directed graphs is born resilient, Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente, Degree sequences forcing Hamilton cycles in directed graphs, On pancyclic digraphs, The total chromatic number of regular graphs whose complement is bipartite
