Radio k-chromatic number of cycles for large k

DOI10.1142/S1793830917500318zbMath1373.05162OpenAlexW2594431613MaRDI QIDQ5367524

Denise Sakai Troxell, Joshua Langowitz, Jessica Oehrlein, Nathaniel J. Karst

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500318

zbMATH Keywords

multilevel distance labelingradio labelingradio \(k\)-labelingradio antipodal labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Optimal channel assignment and \(L(p,1)\)-labeling ⋮ Radio-\(k\)-labeling of cycles for large \(k\) ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ Minimum 2-distance coloring of planar graphs and channel assignment

Cites Work

• Unnamed Item
• Unnamed Item
• Antipodal number of some powers of cycles
• On characterizing radio \(k\)-coloring problem by path covering problem
• A lower bound for radio \(k\)-chromatic number
• Relating path coverings to vertex labellings with a condition at distance two
• Radio labelings of distance graphs
• Radio number for trees
• Radio antipodal colorings of graphs
• Radio k-labelings for Cartesian products of graphs
• Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$
• Labelling Graphs with a Condition at Distance 2
• Radio k-colorings of paths
• Linear and cyclic radio k-labelings of trees
• Multilevel Distance Labelings for Paths and Cycles

This page was built for publication: Radio k-chromatic number of cycles for large k