𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Upper Bound for the Excessive Index of an r-Graph

✍ Scribed by Giuseppe Mazzuoccolo

Book ID
112121143
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
599 KB
Volume
73
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for the minimum rank of a
An upper bound for the minimum rank of a graph
✍ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 137 KB
An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for total colouring of gr
An upper bound for total colouring of graphs
✍ Colin J.H. McDiarmid; AbdΓ³n SΓ‘nchez-Arroyo πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 235 KB

An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co