Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
From MaRDI portal
Publication:3588862
DOI10.21136/mb.2009.140642zbMath1212.05236OpenAlexW2726943575MaRDI QIDQ3588862
Srinivasa Rao Kola, Pratima Panigrahi
Publication date: 10 September 2010
Full work available at URL: https://eudml.org/doc/38075
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn, Antipodal number of some powers of cycles, A linear algorithm for radio \(k\)-coloring powers of paths having small diameter, Radio k-chromatic number of cycles for large k, Unnamed Item, On characterizing radio \(k\)-coloring problem by path covering problem, A lower bound for radio \(k\)-chromatic number, A lower bound technique for radio \(k\)-coloring, Radio $k$-labeling of paths, Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)