A Radio Coloring of a Hypercube

DOI10.1080/00207160211287MaRDI QIDQ4551460zbMATH OpenOpenAlexFDO

Authors Ophir Frieder, Peng-Jun Wan, Frank Harary

Publication date 11 December 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160211287

zbMATH Keywords

Hamming codehypercubesradio coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A distance-labelling problem for hypercubes
• Structural Information and Communication Complexity
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The L(d₁,d₂)-labeling problem on graphs

Cited in

(9)

• A distance-labelling problem for hypercubes
• Radio antipodal colorings of cycles
• L(2,1)-labeling of interval graphs
• On circular-L(2, 1)-labellings of products of graphs
• Structural Information and Communication Complexity
• Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
• An improved lower bound for the radio k-chromatic number of the hypercube qn
• Toward optimal radio colorings of hypercubes via SAT-solving
• L(p,q)-label coloring problem with application to channel allocation

This page was built for publication: A Radio Coloring of a Hypercube

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