The following pages link to (Q3152424):
Displaying 9 items.
- Elementary landscape decomposition of the frequency assignment problem (Q652134) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems (Q1599359) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- Frequency planning and ramifications of coloring (Q4786789) (← links)
