Improved bounds for some of the radio k-chromatic numbers of paths

zbMATH Open1195.05028MaRDI QIDQ3565895FDOQ3565895

Authors: Pratima Panigrahi, Srinivasa Rao Kola 

Publication date: 7 June 2010

Recommendations

• Radio k-colorings of paths
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• scientific article; zbMATH DE number 7725444
• A lower bound for radio \(k\)-chromatic number
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (7)

• Improved upper bounds for nearly antipodal chromatic number of paths
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).
• Title not available (Why is that?)
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Radio k-colorings of paths

This page was built for publication: Improved bounds for some of the radio \(k\)-chromatic numbers of paths

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