Algorithms for finding distance-edge-Colorings of graphs

DOI10.1007/11533719_81MaRDI QIDQ5717003zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Xiao Zhou, Takao Nishizeki, 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

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

Recommendations

• Algorithms for finding distance-edge-colorings of graphs
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• Distance Coloring
• Algorithms for finding f-colorings of partial k-trees
• Edge-Coloring Partialk-Trees

Cited in

(8)

• Algorithms for finding distance-edge-colorings of graphs
• Average distance in colored graphs
• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• Distance Coloring
• Distance edge coloring and collision-free communication in wireless sensor networks
• Distance edge coloring of the Kronecker product of some graphs
• Chromatic index under parameterized settings

This page was built for publication: Algorithms for finding distance-edge-Colorings of graphs

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