Pages that link to "Item:Q1182897"
From MaRDI portal
The following pages link to \(T\)-colorings of graphs: recent results and open problems (Q1182897):
Displayed 50 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q930929) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
- Greedy \(T\)-colorings of graphs (Q1024485) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- No-hole 2-distant colorings (Q1310246) (← links)
- Relating path coverings to vertex labellings with a condition at distance two (Q1343254) (← links)
- \(T\)-chromatic polynomials (Q1343268) (← links)
- \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- Some results on list \(T\)-colourings (Q1377778) (← links)
- \(T\)-choosability in graphs (Q1383364) (← 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)
- Interference patterns in bijective colorings of 2-regular graphs (Q1566572) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- Representation of lattices via set-colored posets (Q1800386) (← links)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← links)
- Radio number for total graph of paths (Q1952708) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Lambda number of the power graph of a finite group (Q2038885) (← links)
- Wegner's conjecture on 2-distance coloring (Q2151384) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- List \(r\)-dynamic coloring of sparse graphs (Q2309401) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
- The edge span of T-coloring on graph \(C^{d}_{n}\) (Q2371031) (← links)
- Radio number for middle graph of paths (Q2413342) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)