Equitable edge-colorings of simple graphs

DOI10.1002/jgt.20499zbMath1221.05168OpenAlexW2068003283MaRDI QIDQ3083408

Xia Zhang, Gui Zhen Liu

Publication date: 21 March 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20499

zbMATH Keywords

simple graphs\(f\)-chromatic index\(f\)-coloringequitable edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Polychromatic colorings of hypergraphs with high balance ⋮ Equitable factorizations of edge-connected graphs ⋮ Some class 1 graphs on \(g_c\)-colorings ⋮ Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰ ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ On edge covering colorings of graphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ On evenly-equitable, balanced edge-colorings and related notions ⋮ A note on polychromatic colorings of plane graphs

Cites Work

• Unnamed Item
• Class one graphs
• A sufficient condition for equitable edge-colourings of simple graphs
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Some graphs of class 1 for \(f\)-colorings
• A generalization of edge-coloring in graphs
• Improved bounds for the chromatic index of graphs and multigraphs
• Regular Graphs of High Degree are 1-Factorizable

This page was built for publication: Equitable edge-colorings of simple graphs