\(T\)-colorings of graphs
From MaRDI portal
Publication:1197028
DOI10.1016/0012-365X(92)90603-DzbMath0779.05021MaRDI QIDQ1197028
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90603-d
Related Items
On the double total dominator chromatic number of graphs, Finite-dimensional \(T\)-colorings of graphs, SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS, Mixed hypergraphs and other coloring problems, No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups, Distance graphs and the \(T\)-coloring problem, 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, Asymptotic clique covering ratios of distance graphs, On optimal \(M\)-sets related to Motzkin's problem, The edge span of T-coloring on graph \(C^{d}_{n}\), Choosability of graphs with infinite sets of forbidden differences, On \(T\)-set of \(T\)-colorings, \(T\)-coloring of certain networks
Cites Work
