A lower bound for radio k-chromatic number

DOI10.1016/J.DAM.2014.05.004zbMATH Open1319.05056OpenAlexW2038453821MaRDI QIDQ491602FDOQ491602

Authors Laxman Saha, Pratima Panigrahi

Publication date 18 August 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.05.004

zbMATH Keywords

channel assignment problemradio numberspanradio \(k\)-chromatic numberradio \(k\)-coloringantipodal number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• A lower bound technique for radio \(k\)-coloring
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• Radio k-colorings of paths

Cites work

• scientific article; zbMATH DE number 5850548 (Why is no real title available?)
• scientific article; zbMATH DE number 2154968 (Why is no real title available?)
• scientific article; zbMATH DE number 2170463 (Why is no real title available?)
• scientific article; zbMATH DE number 2188457 (Why is no real title available?)
• A note on radio antipodal colourings of paths.
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Antipodal labelings for cycles.
• Antipodal number of some powers of cycles
• Handbook of product graphs
• Labelling Graphs with a Condition at Distance 2
• Multilevel Distance Labelings for Paths and Cycles
• Nearly antipodal chromatic number \(ac'(P_n)\) of the path \(P_n\).
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• On the radio number of toroidal grids
• Optimal radio labellings of complete \(m\)-ary trees
• Radio antipodal colorings of cycles
• Radio labelings of graphs
• Radio number for trees
• Radio numbers for generalized prism graphs
• The radio antipodal and radio numbers of the hypercube.
• The radio number of \(C_n\square C_n\).

Cited in

(27)

• A graph radio \(k\)-coloring algorithm
• Radio-\(k\)-labeling of cycles for large \(k\)
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set
• Radio \(k\)-chromatic number of full \(m\)-ary trees
• Triameter of graphs
• scientific article; zbMATH DE number 7725444 (Why is no real title available?)
• Radio \(k\)-labeling of paths
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• Radio k-colorings of paths
• Optimal radio labellings of block graphs and line graphs of trees
• Antipodal number of full \(m\)-ary trees
• A lower bound for radio \(k\)-chromatic number of an arbitrary graph
• Radio \(k\)-chromatic number of cycles for large \(k\)
• A new graph radio \(k\)-coloring algorithm
• On the radio \(k\)-chromatic number of some classes of trees
• Radio fuzzy graphs and assignment of frequency in radio stations
• Improved bounds for some of the radio \(k\)-chromatic numbers of paths
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• On the radio number of square of graphs
• Antipodal radio labelling of full binary trees
• A note on the triameter of graphs
• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• A lower bound technique for radio \(k\)-coloring
• Radio graceful Hamming graphs
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
• Relationship between radio \(k\)-chromatic number of graphs and square graphs

This page was built for publication: A lower bound for radio \(k\)-chromatic number

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