Pages that link to "Item:Q5154598"

The following pages link to Upper bound for radio -chromatic number of graphs in connection with partition of vertex set (Q5154598):

Displaying 8 items.

• Antipodal number of some powers of cycles (Q411663) (← links)
• On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
• 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)
• A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number (Q2012891) (← links)
• Radio \(k\)-chromatic number of full \(m\)-ary trees (Q2075390) (← links)
• A new graph radio k-coloring algorithm (Q4621302) (← links)
• Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)