Even bonds of prescribed directed parity
The electronic journal of combinatorics, Tome 12 (2005)
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.
@article{10_37236_1961,
author = {Sven Hartmann and C.H.C. Little},
title = {Even bonds of prescribed directed parity},
journal = {The electronic journal of combinatorics},
year = {2005},
volume = {12},
doi = {10.37236/1961},
zbl = {1079.05084},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1961/}
}
Sven Hartmann; C.H.C. Little. Even bonds of prescribed directed parity. The electronic journal of combinatorics, Tome 12 (2005). doi: 10.37236/1961
Cité par Sources :