𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eigenvalues and partitionings of the edges of a graph

✍ Scribed by A.J. Hoffman

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
541 KB
Volume
5
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monochromatic cycle partitions of edge-c
Monochromatic cycle partitions of edge-colored graphs
✍ GΓ‘bor N. SΓ‘rkΓΆzy πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 88 KB πŸ‘ 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, GyΓ‘rfΓ‘s and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver

On partitioning the edges of graphs into
On partitioning the edges of graphs into connected subgraphs
✍ M. JΓΌnger; G. Reinelt; W. R. Pulleyblank πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

Edge-partitions of planar graphs and the
Edge-partitions of planar graphs and their game coloring numbers
✍ Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang; Xuding Zhu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 98 KB πŸ‘ 1 views

Let G be a planar graph and let g(G) and Á(G) be its girth and maximum degree, respectively. We show that G has an edge-partition into a forest and a subgraph H so that (i) -cycles (though it may contain 3-cycles). These results are applied to find the following upper bounds for the game coloring n