scientific article
From MaRDI portal
Publication:2765170
zbMath0989.05102MaRDI QIDQ2765170
David Erwin, Ping Zhang, Gary Chartrand, Frank Harary
Publication date: 22 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Radio number for middle graph of dandelion ⋮ Radio mean labeling of a graph ⋮ Radio numbers of some caterpillars ⋮ Radio secure number of a graph ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Radio graceful Hamming graphs ⋮ New results on radio \(k\)-labelings of distance graphs ⋮ On the radio \(k\)-chromatic number of some classes of trees ⋮ Unnamed Item ⋮ Distance edge coloring and collision‐free communication in wireless sensor networks ⋮ Further results on the radio number of trees ⋮ Radio number for middle graph of paths ⋮ An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn ⋮ A linear algorithm for radio \(k\)-coloring powers of paths having small diameter ⋮ Radio number for total graph of paths ⋮ Greedy \(F\)-colorings of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Radio number of trees ⋮ A new graph radio k-coloring algorithm ⋮ Radio number of trees ⋮ Radio labelings of distance graphs ⋮ Improved lower bounds for the radio number of trees ⋮ On characterizing radio \(k\)-coloring problem by path covering problem ⋮ Unnamed Item ⋮ A lower bound for radio \(k\)-chromatic number ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ Antipodal number of full \(m\)-ary trees ⋮ On the radio number for corona of paths and cycles ⋮ Upper bound for radio -chromatic number of graphs in connection with partition of vertex set ⋮ Radio number for trees ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ A lower bound technique for radio \(k\)-coloring ⋮ Radio $k$-labeling of paths ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ Hamiltonian colorings of graphs ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ On Hamiltonian colorings of graphs ⋮ Unnamed Item ⋮ Radio numbers of certain \(m\)-distant trees ⋮ On real number labelings and graph invertibility ⋮ On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups ⋮ Multilevel Bandwidth and Radio Labelings of Graphs ⋮ Antipodal radio labelling of full binary trees ⋮ Radio \(k\)-chromatic number of full \(m\)-ary trees ⋮ Radio fuzzy graphs and assignment of frequency in radio stations ⋮ Distance-constrained labeling of complete trees ⋮ Relationship between radio k-chromatic number of graphs and square graphs ⋮ Radio number for the product of a path and a complete graph
