Pages that link to "Item:Q488288"
From MaRDI portal
The following pages link to On characterizing radio \(k\)-coloring problem by path covering problem (Q488288):
Displaying 8 items.
- Antipodal number of full \(m\)-ary trees (Q1981781) (← links)
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number (Q2012891) (← links)
- Antipodal radio labelling of full binary trees (Q2039697) (← links)
- Triameter of graphs (Q2227115) (← links)
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem (Q4555205) (← links)
- (Q5037233) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- Radio k-chromatic number of cycles for large k (Q5367524) (← links)
