List \(T\)-colorings of graphs

From MaRDI portal
Publication:1309815

DOI10.1016/0166-218X(93)90015-GzbMath0788.05047MaRDI QIDQ1309815

Barry A. Tesman

Publication date: 15 May 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)




Related Items

The channel assignment problem for mutually adjacent sites, The edge span of T-coloring on graph \(C^{d}_{n}\), \(T\)-coloring of certain networks, \(T\)-graphs and the channel assignment problem, Some new bounds on \(T_{r}\)-choosability, Choosability of planar graphs, No-hole \(k\)-tuple \((r+1)\)-distant colorings, No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles, A rainbow about \(T\)-colorings for complete graphs, Some results on list \(T\)-colourings, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, \(T\)-choosability in graphs, A general framework for enumerating equivalence classes of solutions, On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs, The complexity of the \(T\)-coloring problem for graphs with small degree, A polynomial algorithm for finding \(T\)-span of generalized cacti, On two generalizations of the Alon-Tarsi polynomial method, \(T\)-colorings of graphs: recent results and open problems, Orientations of graphs with prescribed weighted out-degrees, Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube, Choosability of graphs with infinite sets of forbidden differences, \(T\)-colorings of graphs, List colourings of planar graphs, No-hole \((r+1)\)-distant colorings, Amenable colorings, List colourings of planar graphs. (Reprint), On the hardness of allocating frequencies for hybrid networks, Interference patterns in bijective colorings of 2-regular graphs, Circular choosability, A short proof of a conjecture on the \(T_r\)-choice number of even cycles, On \(T\)-set of \(T\)-colorings, List \(T\)-colorings of graphs, No-hole 2-distant colorings, SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS, List version of \(L(d,s)\)-labelings



Cites Work