## Abstract We consider a class of asymmetric twoβperson games played on graphs, and characterize all the positions in the game.
A note concerning graphs with unique f-factors
β Scribed by Bill Jackson; R. W. Whitty
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 74 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that if a 2-edge connected graph G has a unique f-factor F, then some vertex has the same degree in F as in G. This conclusion is the best possible, even if the hypothesis is considerably strengthened.
- All graphs considered are finite but may contain loops and multiple edges.
Let G be a graph and let f be a function from the vertet set V(G) to the set
π SIMILAR VOLUMES
## Abstract A graph property is any class of simple graphs, which is closed under isomorphisms. Let __H__ be a given graph on vertices __v__~1~, β¦, __v__~__n__~. For graph properties π«~1~, β¦, π«~__n__~, we denote by __H__[π«~1~, β¦, π«~__n__~] the class of those (π«~1~, β¦, π«~__n__~) βpartitionable grap
## Abstract We present an algebraic proof of the following result: a set of edges of a multigraph __G__ is contained in some cycle of __G__ iff the set contains no odd cocycle of __G__ (βcycleβ means here: edge disjoint sum of elementary cycles). As a corollary we obtain the characterization of sub