Pages that link to "Item:Q4470433"
From MaRDI portal
The following pages link to Approximations for -Colorings of Graphs (Q4470433):
Displaying 50 items.
- \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs (Q1680868) (← links)
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs (Q1759841) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function (Q1888168) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs (Q2840553) (← links)
- On \(L(2,1)\)-coloring split permutation graphs (Q2918470) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (Q3442863) (← links)
- Approximations to <i>m</i>‐Colored Complete Infinite Hypergraphs (Q3466346) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- (Q4691779) (← links)
- (Q4947488) (← links)
- Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
- L(3,1)-labeling of circulant graphs (Q5063266) (← links)
