… of an odd cover of a graph. We provide two algebraic perspectives on odd covers, both of …
A family of graphs whose minimum odd cover cardinality is bounded away from this general …

… A (finite) graph is odd if all its vertices have odd degrees. The principal aim of this survey is
… simple graph admits an odd 3 -edge-covering, ie, a cover by (at most) three odd subgraphs. …

… to cover all odd cycles in graphs of given order and odd girth. … We start with a graph G of
order at most n with finite odd girth at … a set T of at most ~n 2 edges that cover all odd cycles. …

… of complete 3-partite 3-graphs such that each 3-set is in an odd number of them. We show that
the odd cover number of K … We say a set of complete r-partite r-graphs is an odd cover of K …

… for a class of graphs containing all bridgeless cubic graphs that are ‘almost… graph G according
to [5]: Let C be a cycle in G. Then a component H of G[C] is called odd if |V(H) ∩ (G)| is odd…

… Let t3 be a graph with point set P, let B be a Cover of G and W = P -- B thp .,orresponding …
Conversely, if B is not minimum and S is a minimum cover, we can take F = (BUS) -- (B n S) …

… a graph can give on its path odd cover number. A topological graph is an equivalence class
of graphs, … of G, then a path odd-cover of G naturally gives a path odd-cover of H, and so we …

… cover .9 of a graph is a nice cover. Theorem 1 asserts that the existence of a nice cover in a
graph is … The following result shows that the only minimal edge covers of a graph that can be …

… Since the odd/even approach is the only way that is known to prove … to identify graphs whose
degree sequences correspond to the (odd) … The dashed edges cover the cases for odd n. …

… graphs is used to define and study such double cover projections. An upper bound is found
for the number of distinct double covers p : G -»• £?„ for a given graph … cover of an odd circuit …