AbstractOur aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in edge-weighted digraphs
AbstractA weighted graph is one in which every edge e is assigned a nonnegative number w(e), called ...
A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called ...
The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits...
Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to ed...
AbstractOur aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dir...
AbstractA weighted digraph is a digraph such that every arc is assigned a nonnegative number, called...
AbstractA weighted graph is a graph provided with an edge-weighting function w from the edge set to ...
A weighted graph is a graph provided with an edge-weighting function w from the edge set to nonnegat...
A weighted graph is a graph in which each edge is assigned a non-negative number, called the weight....
An (edge-)weighted graph is a graph in which each edge e is assigned a nonnegative real number w(e),...
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices ...
AbstractA digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct v...
AbstractA weighted graph is a graph in which each edge is assigned a non-negative number, called the...
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the ...
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the ...
AbstractA weighted graph is one in which every edge e is assigned a nonnegative number w(e), called ...
A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called ...
The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits...
Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to ed...
AbstractOur aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dir...
AbstractA weighted digraph is a digraph such that every arc is assigned a nonnegative number, called...
AbstractA weighted graph is a graph provided with an edge-weighting function w from the edge set to ...
A weighted graph is a graph provided with an edge-weighting function w from the edge set to nonnegat...
A weighted graph is a graph in which each edge is assigned a non-negative number, called the weight....
An (edge-)weighted graph is a graph in which each edge e is assigned a nonnegative real number w(e),...
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices ...
AbstractA digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct v...
AbstractA weighted graph is a graph in which each edge is assigned a non-negative number, called the...
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the ...
A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the ...
AbstractA weighted graph is one in which every edge e is assigned a nonnegative number w(e), called ...
A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called ...
The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits...
DOI
Add to ORKG