Radio k-chromatic number of cycles for large k

DOI10.1142/S1793830917500318zbMATH Open1373.05162OpenAlexW2594431613MaRDI QIDQ5367524FDOQ5367524

Authors: Joshua Langowitz, Jessica Oehrlein, Denise Sakai Troxell, 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

Recommendations

• Radio-\(k\)-labeling of cycles for large \(k\)
• scientific article; zbMATH DE number 7725444
• A lower bound for radio \(k\)-chromatic number
• scientific article; zbMATH DE number 2188457
• Upper bound for radio \(k\)-chromatic number of graphs in connection with partition of vertex set

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)

Cites Work

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

Cited In (11)

• On radio \((n-4)\)-chromatic number of the path \(P_n\)
• Radio antipodal colorings of cycles
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Planar graphs without chordal 5-cycles are 2-good
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
• Optimal channel assignment and \(L(p,1)\)-labeling
• Minimum 2-distance coloring of planar graphs and channel assignment
• Radio-\(k\)-labeling of cycles for large \(k\)
• Relationship between radio \(k\)-chromatic number of graphs and square graphs
• Title not available (Why is that?)
• Antipodal number of some powers of cycles

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

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