Further Results on T-Coloring and Frequency Assignment Problems

DOI10.1137/S0895480189171746zbMath0810.05026MaRDI QIDQ4317706

Arundhati Raychaudhuri

Publication date: 20 December 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmperfectly orderable graphscolorsminimum span\(T\)-coloring problemfrequency assignment problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Asymptotic clique covering ratios of distance graphs ⋮ The channel assignment problem for mutually adjacent sites ⋮ \(T\)-coloring of certain networks ⋮ T-Coloring of product graphs ⋮ \(T\)-graphs and the channel assignment problem ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ A rainbow about T-colorings for complete graphs ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ A polynomial algorithm for finding \(T\)-span of generalized cacti ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube ⋮ Models and solution techniques for frequency assignment problems ⋮ Interference patterns in bijective colorings of 2-regular graphs ⋮ Distance graphs and \(T\)-coloring ⋮ SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS

This page was built for publication: Further Results on T-Coloring and Frequency Assignment Problems