𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Antimagic Properties of Graphs with Large Maximum Degree

✍ Scribed by Zelealem B. Yilma

Book ID
112121127
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
503 KB
Volume
72
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Total colorings of planar graphs with la
Total colorings of planar graphs with large maximum degree
✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 3 views

It is proved that a planar graph with maximum degree βˆ† β‰₯ 11 has total (vertex-edge) chromatic number βˆ† + 1.

The chromatic index of graphs with large
The chromatic index of graphs with large maximum degree
✍ Michael J. Plantholt πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 508 KB

Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree A(G) or A(G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.

Sizes of graphs with induced subgraphs o
Sizes of graphs with induced subgraphs of large maximum degree
✍ Paul ErdΕ‘s; Talmage James Reid; Richard Schelp; William Staton πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 249 KB

Graphs with n + k vertices in which every set of n +j vertices induce a subgraph of maximum degree at least n are considered. For j = 1 and for k fairly small compared to n, we determine the minimum number of edges in such graphs.