𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitions of Numbers for Finding Certain Graphs

✍ Scribed by Fielder, Daniel C.

Book ID
114615022
Publisher
IEEE
Year
1968
Tongue
English
Weight
826 KB
Volume
11
Category
Article
ISSN
0018-9359

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Chromatic Numbers for Certain Graphs
Chromatic Numbers for Certain Graphs
✍ Laskar, R.; Hare, W. πŸ“‚ Article πŸ“… 1972 πŸ› Oxford University Press 🌐 English βš– 89 KB
On vertex k-partitions of certain infini
On vertex k-partitions of certain infinite graphs
✍ Douglas Cenzer; Edward Howorka πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana

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