EULERIAN AND BIPARTITE ORIENTABLE MATROIDS
This chapter focuses on extending the characterizations of Eulerian graphs via orientations. An Eulerian tour of a graph G induces an orientation with the property that every cocircuit (minimal edge cut) in G is traversed an equal number of times in each direction. In this sense, the orientation can be considered balanced. Applying duality to planar graphs, these notions produce characterizations of bipartite graphs. These notions are further extended to oriented matroids.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.