The following pages link to \(T\)-colorings of graphs (Q1197028):
Displaying 17 items.
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
- \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
- The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032) (← links)
- A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- On \(T\)-set of \(T\)-colorings (Q2581436) (← links)
- \(T\)-coloring of certain networks (Q2630781) (← links)
- On the double total dominator chromatic number of graphs (Q5101880) (← links)
- SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS (Q5865377) (← links)
- Finite-dimensional \(T\)-colorings of graphs (Q5941520) (← links)
