𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


On the cycle space of graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 68 KB
The number of edges in a maximum cycleβ€”d
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

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( [~(

The cycle space of an embedded graph
✍ B. Richter; H. Shank πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 1 views

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

Connected cutsets of a graph and triangl
✍ P Duchet; M Las Vergnas; H Meyniel πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 602 KB

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