Paths and circuits in partially directed graphs

@article{Barnette1999PathsAC,
  title={Paths and circuits in partially directed graphs},
  author={David W. Barnette and Shelley Gillett},
  journal={Discrete Mathematics},
  year={1999},
  volume={195},
  pages={239-243}
}
Although 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. (~) 1999 Elsevier Science B.V. All rights reserved 

From This Paper

Topics from this paper.
1 Citations
1 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…