A parallel algorithm for generating ideal IC-colorings of cycles

DOI10.1016/J.AMC.2014.10.119MaRDI QIDQ902868zbMATH OpenOpenAlexFDO

Authors Limin Liu

Publication date 4 January 2016

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2014.10.119

zbMATH Keywords

branch-and-boundIC-coloringIC-indexideal IC-coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• IC-colorings and IC-indices of graphs
• The maximal IC-colorings of \(K_{1, 2, n}\)
• IC-index and maximum IC-colorings of double-stars
• The IC-indices of complete multipartite graphs
• On the \((k,i)\)-coloring of cacti and complete graphs.

Cites work

• scientific article; zbMATH DE number 5903945 (Why is no real title available?)
• scientific article; zbMATH DE number 683826 (Why is no real title available?)
• scientific article; zbMATH DE number 1472166 (Why is no real title available?)
• scientific article; zbMATH DE number 3057976 (Why is no real title available?)
• A Postage Stamp Problem
• A survey: Recent results, conjectures, and open problems in labeling graphs
• IC-colorings and IC-indices of graphs
• On Additive Bases and Harmonious Graphs
• The IC-indices of complete bipartite graphs
• The maximal IC-colorings of \(K_{1, 2, n}\)

This page was built for publication: A parallel algorithm for generating ideal IC-colorings of cycles

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