𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Irregular colorings of regular graphs

✍ Scribed by Mark Anderson; Richard P. Vitray; Jay Yellen

Book ID
113567662
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
377 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interference-Minimizing Colorings of Reg
Interference-Minimizing Colorings of Regular Graphs
✍ Fishburn, P. C.; Kim, J. H.; Lagarias, J. C.; Wright, P. E. πŸ“‚ Article πŸ“… 1998 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 389 KB
Regularizing irregular graphs
Regularizing irregular graphs
✍ Fred Buckley πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 348 KB
Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge

Vertex-distinguishing edge-colorings of
Vertex-distinguishing edge-colorings of 2-regular graphs
✍ P. Wittmann πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 755 KB

Aigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) < v'& + 0( 1) holds. Here it is shown that c(G) < & + 0( 1).