β Scribed by Arnold L. Rosenberg
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A cycle in a graph is a set of edges that covers each vertex an even number of times. A cocycle is a collection of edges that intersects each cycle in an even number of edges. A bicycle is a collection of edges that is both a cycle and a cocycle. The cycles, cocycles, and bicycles each
## Abstract We give a detailed algebraic characterization of when a graph __G__ can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph __G__\* on the same edge set as __G__, which satisfies algebraic conditions inspired by homology groups and inte
## Abstract Let Ξ³(__G__) ΞΉ(__G__) be the domination number and independent domination number of a graph (__G__), respectively. A graph (__G__) is called domination perfect if Ξ³(__H__) = ΞΉ(__H__), for every induced subgraph __H__ of (__G__). There are many results giving a partial characterization o