AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every matching in a hamiltonian cycle or a cycle not necessarily hamiltonian. Moreover, for the hamiltonian case we prove that the condition is almost best possible
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order 2n...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
AbstractWe prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: for a≥...
In this paper, the characterization of a bipartite graph will be first described by using the defini...
AbstractWe give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipa...
Graphs and AlgorithmsWe conjecture Ore and Erdős type criteria for a balanced bipartite graph of ord...
We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a l...
Graphs and AlgorithmsInternational audienceWe conjecture Ore and Erdős type criteria for a balanced ...
Graphs and AlgorithmsInternational audienceWe conjecture Ore and Erdős type criteria for a balanced ...
In this paper, the characterization of bipartite graph will be first described by using the definiti...
AbstractWe give a degree sum condition for three independent vertices under which every matching of ...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order 2n...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
AbstractWe prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: for a≥...
In this paper, the characterization of a bipartite graph will be first described by using the defini...
AbstractWe give here two sufficient conditions for a bipartite balanced graph of order 2n to be bipa...
Graphs and AlgorithmsWe conjecture Ore and Erdős type criteria for a balanced bipartite graph of ord...
We conjecture Ore and Erdős type criteria for a balanced bipartite graph of order 2n to contain a l...
Graphs and AlgorithmsInternational audienceWe conjecture Ore and Erdős type criteria for a balanced ...
Graphs and AlgorithmsInternational audienceWe conjecture Ore and Erdős type criteria for a balanced ...
In this paper, the characterization of bipartite graph will be first described by using the definiti...
AbstractWe give a degree sum condition for three independent vertices under which every matching of ...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
DOI
Add to ORKG