## Abstract Whitney's theorem on line graphs is extended to the class of generalized line graphs defined by Hoffman.
A note on the cycle multiplicity of line-graphs and total graphs
✍ Scribed by J.M.S Simões Pereira
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 354 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. path‐cycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g
We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons
## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_
## Abstract Sharp lower bounds for the point connectivity and line connectivity of the line graph __L(G__) and the total graph __T(G__) of a graph __G__ are determined. The lower bounds are expressed in terms of the point connectivity __k__, line connectivity λ, and minimum degree δ of __G.__ It is