Pages that link to "Item:Q3701467"

The following pages link to An Asymptotic Approach to the Channel Assignment Problem (Q3701467):

Displaying 16 items.

• On the density of integral sets with missing differences from sets related to arithmetic progressions (Q627623) (← links)
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
• Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
• \(T\)-colorings of graphs: recent results and open problems (Q1182897) (← links)
• Distance graphs and \(T\)-coloring (Q1305534) (← links)
• The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
• \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
• Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
• Density of sets with missing differences and applications (Q2054653) (← links)
• Maximal density of integral sets with missing differences and the kappa values (Q2078256) (← links)
• Sequences of integers with three missing separations (Q2297912) (← links)
• Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
• Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
• On Graceful Directed Graphs (Q3701444) (← links)
• (Q5384184) (← links)
• Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings (Q5889217) (← links)