Integer Functions on the Cycle Space and Edges of a Graph
β Scribed by Daniel C. Slilaty
- Publisher
- Springer Japan
- Year
- 2010
- Tongue
- English
- Weight
- 114 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(
## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface β. Let __G__Β° denote the geometric dual of __G__. For a subset __d__ of __E__, let Ο__d__ denote the edges of __G__Β° that are dual to those edges of __G__ in __d__. We prove the following generalizations of wellβ
We investigate some properties of graphs whose cycle space has a basis constituted of triangles ('null-homotopic' graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto Ks. These characterizations involve separating subsets and decompos