Further Results on T-Coloring and Frequency Assignment Problems
From MaRDI portal
Publication:4317706
DOI10.1137/S0895480189171746zbMath0810.05026MaRDI QIDQ4317706
Publication date: 20 December 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
greedy algorithm; perfectly orderable graphs; colors; minimum span; \(T\)-coloring problem; frequency assignment problems
05C15: Coloring of graphs and hypergraphs
Related Items
Models and solution techniques for frequency assignment problems, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, \(T\)-colorings of graphs: recent results and open problems, Distance graphs and \(T\)-coloring, 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, Interference patterns in bijective colorings of 2-regular graphs, Asymptotic clique covering ratios of distance graphs