Pages that link to "Item:Q1336445"
From MaRDI portal
The following pages link to The channel assignment problem for mutually adjacent sites (Q1336445):
Displayed 9 items.
- 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)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- (Q4519133) (← links)