Pages that link to "Item:Q2876567"

The following pages link to A Graph Radio k-Coloring Algorithm (Q2876567):

Displaying 8 items.

• Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← 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)
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
• A new graph radio k-coloring algorithm (Q4621302) (← links)
• Radio $k$-labeling of paths (Q5164256) (← links)
• Relationship between radio <i>k</i>-chromatic number of graphs and square graphs (Q5861707) (← links)