Pages that link to "Item:Q512555"
From MaRDI portal
The following pages link to A lower bound technique for radio \(k\)-coloring (Q512555):
Displaying 9 items.
- Antipodal number of full \(m\)-ary trees (Q1981781) (← links)
- Antipodal radio labelling of full binary trees (Q2039697) (← links)
- Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
- Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← links)
- On the radio \(k\)-chromatic number of some classes of trees (Q2657544) (← links)
- On the radio number for corona of paths and cycles (Q5154588) (← links)
- Upper bound for radio -chromatic number of graphs in connection with partition of vertex set (Q5154598) (← links)
- (Q6115897) (← links)
- On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)