Even Bonds of Prescribed Directed Parity
Abstract
Given a set $S$ of vertices in a graph, the cocycle determined by $S$ is the set of edges joining a vertex in $S$ to a vertex not in $S$. A bond is a minimal non-empty cocycle. We characterise graphs that admit an orientation under which every bond of even cardinality has a prescribed directed parity.
Published
2005-11-25
How to Cite
Hartmann, S., & Little, C. (2005). Even Bonds of Prescribed Directed Parity. The Electronic Journal of Combinatorics, 12(1), R64. https://doi.org/10.37236/1961
Issue
Article Number
R64