Pages that link to "Item:Q1336445"
From MaRDI portal
The following pages link to The channel assignment problem for mutually adjacent sites (Q1336445):
Displayed 15 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)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- Interference patterns in bijective colorings of 2-regular graphs (Q1566572) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Density of sets with missing differences and applications (Q2054653) (← links)
- Sequences of integers with three missing separations (Q2297912) (← links)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- \(T\)-coloring of certain networks (Q2630781) (← links)
- Maximal density of sets with missing differences and various coloring parameters of distance graphs (Q2663373) (← links)
- Channel assignment and weighted coloring (Q4519133) (← links)
- Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) (Q6171907) (← links)