The maximal IC-colorings of K₁, 2, n

MaRDI QIDQ4908004zbMATH OpenFDO

Authors Shyh-Nan Lee, Limin Liu

Publication date 27 February 2013

Full work available at URL http://www.yokohamapublishers.jp/online2/opjnca/vol14/p103.html

zbMATH Keywords

complete tripartite graphIC-coloringIC-index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The IC-indices of complete bipartite graphs
• The IC-indices of complete multipartite graphs
• IC-colorings and IC-indices of graphs
• IC-index and maximum IC-colorings of double-stars
• scientific article; zbMATH DE number 6178423

Cited in

(6)

• The IC-indices of complete multipartite graphs
• IC-colorings and IC-indices of graphs
• IC-colorings and IC-indices of trees of diameter four
• scientific article; zbMATH DE number 6178423 (Why is no real title available?)
• IC-index and maximum IC-colorings of double-stars
• A parallel algorithm for generating ideal IC-colorings of cycles

This page was built for publication: The maximal IC-colorings of \(K_{1, 2, n}\)

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