New Bounds for the Nearly Equitable Edge Coloring Problem

DOI10.1007/978-3-540-77120-3_26MaRDI QIDQ5387764zbMATH OpenOpenAlexFDO

Authors Xuzhen Xie, Takao Ono, Tomio Hirata, Uri Zwick, 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

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

Recommendations

• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
• A better than “best possible” algorithm to edge color multigraphs
• A fast algorithm for equitable coloring

Cites work

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

Cited in

(4)

• Improving lower bounds for equitable chromatic number
• A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387764)