AbstractAlthough questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and a necessary and sufficient condition for covering the edges by n edge disjoint paths when every vertex has even degree
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
AbstractWe consider graphs which contain both directed and undirected edges (partially directed grap...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
We consider graphs which contain both directed and undirected edges (partially directed graphs). We ...
We consider graphs which contain both directed and undirected edges (partially directed graphs). We ...
AbstractWe prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlyin...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
Funding Information: We are very grateful to the anonymous reviewers who helped improved the present...
AbstractWe consider graphs which contain both directed and undirected edges (partially directed grap...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
AbstractWe consider graphs which contain both directed and undirected edges (partially directed grap...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecti...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
We consider graphs which contain both directed and undirected edges (partially directed graphs). We ...
We consider graphs which contain both directed and undirected edges (partially directed graphs). We ...
AbstractWe prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlyin...
A closed walk in a connected graph G that contains every edge of G exactly once is an Eulerian circu...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
Funding Information: We are very grateful to the anonymous reviewers who helped improved the present...
AbstractWe consider graphs which contain both directed and undirected edges (partially directed grap...
A spanning circuit in a graph is a closed trail (no edge is traversed more than once) visiting (cont...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
DOI
Add to ORKG