𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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.

  1. 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


A note concerning asymmetric games on gr
✍ Alvin E. Roth πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.

On uniqueness of a general factorization
✍ Ewa Drgas-Burchardt πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 201 KB πŸ‘ 1 views

## 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

A Note on Sub-Eulerian Graphs
✍ F. Jaeger πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

## 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