Pages that link to "Item:Q1810659"
From MaRDI portal
The following pages link to On the span in channel assignment problems: Bounds, computing and counting (Q1810659):
Displaying 14 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs (Q1759841) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- On the \(L(p,1)\)-labelling of graphs (Q2476282) (← links)
- Some new bounds on \(T_{r}\)-choosability (Q2643324) (← links)
- On λ-coloring split, chordal bipartite and weakly chordal graphs (Q2840553) (← links)
- THE GRAPH-BIN PACKING PROBLEM (Q3224960) (← links)
