Pages that link to "Item:Q512555"

The following pages link to A lower bound technique for radio \(k\)-coloring (Q512555):

Displaying 17 items.

• A lower bound for radio \(k\)-chromatic number (Q491602) (← links)
• An improved lower bound for the radio \(k\)-chromatic number of the hypercube qn (Q623146) (← links)
• 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)
• New results on radio \(k\)-labelings of distance graphs (Q2161267) (← 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)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← 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)
• Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)
• (Q6115897) (← links)
• On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)
• A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters (Q6627041) (← links)
• The radio \(k\)-chromatic number for the corona of arbitrary graph and \(K_1\) (Q6629111) (← links)
• The radio \(k\)-chromatic number for corona of graphs (Q6650317) (← links)