Path multicoloring in spider graphs with even color multiplicity

DOI10.1016/j.ipl.2017.12.009zbMath1429.05057OpenAlexW3132276122MaRDI QIDQ1705690

Aris Pagourtzis, Christina Karousatou, Evangelos Bampas, Katerina Potika

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.12.009

zbMATH Keywords

algorithmsspider graphpath multicoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Routing and path multicoloring
• Path multicoloring with fewer colors in spiders and caterpillars
• Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
• Minimizing maximum fiber requirement in optical networks
• Efficient routing in all-optical networks
• Wavelength assignment in multifiber star networks
• On the f-coloring of multigraphs
• Using euler partitions to edge color bipartite multigraphs
• Selfish Resource Allocation in Optical Networks
• Graph-Theoretic Concepts in Computer Science
• The complexity of path coloring and call scheduling

This page was built for publication: Path multicoloring in spider graphs with even color multiplicity