scientific article; zbMATH DE number 5850548
From MaRDI portal
Publication:3073573
zbMATH Open1224.05451MaRDI QIDQ3073573FDOQ3073573
Authors: Daphne Der-Fen Liu, Melanie Xie 
Publication date: 11 February 2011
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2170463
- Radio number of cube of a path
- Radio number for fourth power paths
- Radio number for middle graph of paths
- Radio number for total graph of paths
- Radio number for eighth power paths
- Radio number for some thorn graphs
- Radio number for middle graph of dandelion
- On the radio number of square of graphs
- Radio number of some wheel related graphs
Applications of graph theory (05C90) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (32)
- Radio number for trees
- Distance-constrained labeling of complete trees
- Improved bounds for radio \(k\)-chromatic number of hypercube \(Q_{n}\)
- Further results on the radio number of trees
- Relationship between radio k-chromatic number of graphs and square graphs
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
- Radio number of trees
- On radio \(k\)-labeling of the power of the infinite path
- Radio labelings of distance graphs
- Radio number for the product of a path and a complete graph
- A linear algorithm for radio \(k\)-coloring powers of paths having small diameter
- Upper bound for radio -chromatic number of graphs in connection with partition of vertex set
- Title not available (Why is that?)
- Radio mean labeling of a graph
- On the radio number of square of graphs
- Radio secure number of a graph
- A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters
- Multilevel Distance Labelings for Paths and Cycles
- A lower bound for radio \(k\)-chromatic number
- Radio $k$-labeling of paths
- An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn
- Antipodal number of some powers of cycles
- Optimal radio labellings of complete \(m\)-ary trees
- On characterizing radio \(k\)-coloring problem by path covering problem
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- Radio number for total graph of paths
- Radio number of trees
- Radio number of cube of a path
- Radio \(k\)-chromatic number of full \(m\)-ary trees
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
- A new graph radio k-coloring algorithm
- Antipodal number of full \(m\)-ary trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073573)
