New Bounds for the Nearly Equitable Edge Coloring Problem

DOI10.1007/978-3-540-77120-3_26zbMath1193.05081OpenAlexW1492721161MaRDI QIDQ5387764

Tomio Hirata, Takao Ono, Uri Zwick, Xuzhen Xie, Mutsunori Yagiura

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A sufficient condition for equitable edge-colourings of simple graphs

This page was built for publication: New Bounds for the Nearly Equitable Edge Coloring Problem