$T$-colorings of graphs: recent results and open problems

DOI10.1016/0012-365X(91)90258-4zbMath0751.05042OpenAlexW2064102927MaRDI QIDQ1182897

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90258-4

zbMATH Keywords

greedy algorithm chordal graph channel assignment problem interference graph $\gamma$-perfect graph $T$-chromatic number $T$-colorings of graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15)

Related Items

Radio number for middle graph of dandelion, Extremal problems on consecutive $L(2,1)$-labelling, The edge span of T-coloring on graph $C^{d}_{n}$, Optimal channel assignment and $L(p,1)$-labeling, An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees, Computing L(p,1)-Labeling with Combined Parameters, Relating path coverings to vertex labellings with a condition at distance two, $T$-chromatic polynomials, $T$-coloring of certain networks, A linear time algorithm to compute square of interval graphs and their colouring, $T$-graphs and the channel assignment problem, Bounds for the frequency assignment problem, Wegner's conjecture on 2-distance coloring, Spectrum graph coloring and applications to Wi-Fi channel assignment, Mixed hypergraphs and other coloring problems, Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs, 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, $L(2,1)$-labelings on the modular product of two graphs, Radio number for middle graph of paths, $L(p,2,1)$-labeling of the infinite regular trees, On the universality and extremality of graphs with a distance constrained colouring, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, A general framework for enumerating equivalence classes of solutions, Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction, An 8-approximation algorithm for $L(2 ,1)$-labeling of unit disk graphs, $L(3, 2, 1)$-labeling of banana trees, Exact $\lambda$-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips, Optimal channel assignment with list-edge coloring, A rainbow about T-colorings for complete graphs, The lambda number of the power graph of a finite $p$-group, An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees, The complexity of the $T$-coloring problem for graphs with small degree, A polynomial algorithm for finding $T$-span of generalized cacti, Special structures in $\mathcal{Q}(4, q)$, projective planes and its application in $L(h, k)$-colorings of their Moore graphs, Radio number for total graph of paths, Unnamed Item, Unnamed Item, Improved upper bounds on the $L(2,1)$-labeling of the skew and converse skew product graphs, Computing $L(p, 1)$-labeling with combined parameters, Choosability of graphs with infinite sets of forbidden differences, $L(1,1)$-labelling of the direct product of a complete graph and a cycle, Price of anarchy for graph coloring games with concave payoff, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, $L(2,1)$-labeling of Kneser graphs and coloring squares of Kneser graphs, The $L(2,1)$-labeling on Cartesian sum of graphs, No-hole $(r+1)$-distant colorings, New upper bounds on the $L(2,1)$-labeling of the skew and converse skew product graphs, An evolutionary approach for bandwidth multicoloring problems, Graph labellings with variable weights, a survey, $L(2,1)$-labeling of direct product of paths and cycles, The $\Delta ^{2}$-conjecture for $L(2,1)$-labelings is true for total graphs, $L(2, 1)$-labeling of permutation and bipartite permutation graphs, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, Models and solution techniques for frequency assignment problems, Lambda number of the power graph of a finite group, The $L(2,1)$-labeling of $K_{1,n}$-free graphs and its applications, Representation of lattices via set-colored posets, $ L ( 2 , 1 )$-labeling of disk intersection graphs, List $r$-dynamic coloring of sparse graphs, Greedy $T$-colorings of graphs, Distance-two labellings of Hamming graphs, Interference patterns in bijective colorings of 2-regular graphs, Improving heuristics for the frequency assignment problem, Distance graphs and the $T$-coloring problem, Optimal $L(d,1)$-labelings of certain direct products of cycles and Cartesian products of cycles, Distance graphs and $T$-coloring, List $T$-colorings of graphs, No-hole 2-distant colorings, Subdivision of the hierarchy of H-colorable graph classes by circulant graphs, SOME RESULTS ON T-COLORING AND ST-COLORING OF GENERALIZED BUTTERFLY GRAPHS, L(3,2,1)-Labeling problems on trapezoid graphs

Cites Work

\(T\)-colorings of graphs: recent results and open problems