On radio \((n-4)\)-chromatic number of the path \(P_n\)

zbMath1210.05044MaRDI QIDQ624132

Pratima Panigrahi, Srinivasa Rao Kola

Publication date: 8 February 2011

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

radio \(k\)-chromatic numberradio \(k\)-coloringspan of a radio \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Antipodal number of some powers of cycles ⋮ Unnamed Item ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Radio $k$-labeling of paths ⋮ Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)

This page was built for publication: On radio \((n-4)\)-chromatic number of the path \(P_n\)