𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounding Fitting Heights of Character Degree Graphs

✍ Scribed by Mark L Lewis

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
92 KB
Volume
242
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Judicious partitions of bounded-degree g
Judicious partitions of bounded-degree graphs
✍ B. BollobΓ‘s; A. D. Scott πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

## Abstract We prove results on partitioning graphs __G__ with bounded maximum degree. In particular, we provide optimal bounds for bipartitions __V__(__G__) = __V__~1~ βˆͺ __V__~2~ in which we minimize {__e__(__V__~1~), __e__(__V__~2~)}. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 46: 131–143, 200

Decreasing the diameter of bounded degre
Decreasing the diameter of bounded degree graphs
✍ Noga Alon; AndrΓ‘s GyΓ‘rfΓ‘s; MiklΓ³s RuszinkΓ³ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 2 views
Polychromatic colorings of bounded degre
Polychromatic colorings of bounded degree plane graphs
✍ Elad Horev; Roi Krakovski πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

Degree bounds for the circumference of 3
Degree bounds for the circumference of 3-connected graphs
✍ Heinz A. Jung; Elkin Vumar πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 229 KB πŸ‘ 1 views

## Abstract Let __C__ be a longest cycle in the 3‐connected graph __G__ and let __H__ be a component of __G__β€‰βˆ’β€‰__V__(__C__) such that |__V__(__H__)| β‰₯ 3. We supply estimates of the form |__C__| β‰₯ 2__d__(__u__) + 2__d__(__v__)β€‰βˆ’β€‰Ξ±(4 ≀ α ≀ 8), where __u__,__v__ are suitably chosen non‐adjacent verti