𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equitable and list equitable colorings of planar graphs without 4-cycles

✍ Scribed by Dong, Aijun; Li, Guojun; Wang, Guanghui

Book ID
120338513
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
638 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Equitable Coloring of Sparse Planar Grap
Equitable Coloring of Sparse Planar Graphs
✍ Luo, Rong; Sereni, Jean-SΓ©bastien; Stephens, D. Christopher; Yu, Gexin πŸ“‚ Article πŸ“… 2010 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 219 KB
Equitable edge-colorings of simple graph
Equitable edge-colorings of simple graphs
✍ Xia Zhang; Guizhen Liu πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

An edge-coloring of a graph G is equitable if, for each v ∈ V (G), the number of edges colored with any one color incident with v differs from the number of edges colored with any other color incident with v by at most one. A new sufficient condition for equitable edge-colorings of simple graphs is