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 32 items.
- No-hole \((r+1)\)-distant colorings (Q688267) (← 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)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← 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)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← 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)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) (← links)
- Subdivision of the hierarchy of H-colorable graph classes by circulant graphs (Q3439166) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)