scientific article

zbMath0976.05028MaRDI QIDQ2718341

David Erwin, Gary Chartrand, Ping Zhang

Publication date: 19 June 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclesdistancediametereccentricityradiusradio antipodal chromatic numberradio antipodal coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ Unnamed Item ⋮ Radio labelings of distance graphs ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Radio $k$-labeling of paths ⋮ Hamiltonian colorings of graphs ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs ⋮ Radio k-Labelings for Cartesian Products of Graphs