Further Results on T-Coloring and Frequency Assignment Problems
From MaRDI portal
Recommendations
Cited in
(27)- Greedy \(T\)-colorings of graphs
- \(T\)-colorings of graphs: recent results and open problems
- Distance graphs and \(T\)-coloring
- List T-colorings of graphs
- The channel assignment problem for mutually adjacent sites
- \(T\)-graphs and the channel assignment problem
- The complexity of the \(T\)-coloring problem for graphs with small degree
- A polynomial algorithm for finding \(T\)-span of generalized cacti
- Graph covers using \(t\)-colourable vertex sets.
- Interference patterns in bijective colorings of 2-regular graphs
- Colouring weighted bipartite graphs with a co-site constraint
- Asymptotic clique covering ratios of distance graphs
- \(T\)-colorings, divisibility and the circular chromatic number
- Contrast in greyscales of graphs
- The edge span of T-coloring on graph \(C^{d}_{n}\)
- \(T\)-coloring of certain networks
- scientific article; zbMATH DE number 1819633 (Why is no real title available?)
- scientific article; zbMATH DE number 1990724 (Why is no real title available?)
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
- \(T\)-coloring of product graphs
- An exact algorithm for the generalized list T-coloring problem
- scientific article; zbMATH DE number 975370 (Why is no real title available?)
- scientific article; zbMATH DE number 227553 (Why is no real title available?)
- SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
- Models and solution techniques for frequency assignment problems
- A rainbow about T-colorings for complete graphs
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
This page was built for publication: Further Results on T-Coloring and Frequency Assignment Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4317706)