\(T\)-colorings of graphs
From MaRDI portal
Publication:1197028
DOI10.1016/0012-365X(92)90603-DzbMath0779.05021OpenAlexW2005080911MaRDI 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
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (17)
Asymptotic clique covering ratios of distance graphs ⋮ 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 ⋮ Mixed hypergraphs and other coloring problems ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ On the double total dominator chromatic number of graphs ⋮ The complexity of the \(T\)-coloring problem for graphs with small degree ⋮ A polynomial algorithm for finding \(T\)-span of generalized cacti ⋮ Choosability of graphs with infinite sets of forbidden differences ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Finite-dimensional \(T\)-colorings of graphs ⋮ Distance graphs and the \(T\)-coloring problem ⋮ Distance graphs and \(T\)-coloring ⋮ On \(T\)-set of \(T\)-colorings ⋮ SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS
Cites Work
This page was built for publication: \(T\)-colorings of graphs
