Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05316MaRDI QIDQ5717003

Takao Nishizeki, Xiao Zhou, Takehiro Ito, Akira Kato

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Related Items

Algorithms for finding distance-edge-colorings of graphs