Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05316OpenAlexW4376561447MaRDI QIDQ5717003

Takehiro Ito, Xiao Zhou, Akira Kato, Takao Nishizeki

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

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Algorithms for finding distance-edge-colorings of graphs

This page was built for publication: Computing and Combinatorics