Approximations for -Colorings of Graphs
From MaRDI portal
Approximations for -Colorings of Graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)
Recommendations
- scientific article; zbMATH DE number 1500531
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- Radiocoloring in planar graphs: Complexity and approximations
- scientific article; zbMATH DE number 1759423
Cited in
(64)- On Injective Colourings of Chordal Graphs
- On approximate graph colouring and MAX-k-CUT algorithms based on the -function
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- Online L(2,1)-coloring problem on paths with restricted size of memory
- Locally injective k-colourings of planar graphs
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Graph labellings with variable weights, a survey
- Determining the \(L(2,1)\)-span in polynomial space
- Injective colouring for H-free graphs
- Labeling bipartite permutation graphs with a condition at distance two
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
- L(p,q)-labeling of graphs with interval representations
- L(1, 2)-edge-labelings for lattices
- Acyclic, star, and injective colouring: bounding the diameter
- Computing \(L(p, 1)\)-labeling with combined parameters
- On L(2,1)-coloring split permutation graphs
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- \(\lambda\)-coloring matrogenic graphs
- On a distance-constrained graph labeling to model cooperation
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- A linear time algorithm for L(2,1)-labeling of trees
- Fast exact algorithm for L(2,1)-labeling of graphs
- Acyclic, star, and injective colouring: bounding the diameter
- Approximations to m‐Colored Complete Infinite Hypergraphs
- The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
- L(3,2,1)-labeling of triangular and toroidal grids
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
- The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
- On (s,t)-relaxed L(2,1)-labeling of graphs
- \(L(2, 1)\)-labeling of circulant graphs
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- Group path covering and distance two labeling of graphs
- On L(2, 1)-labeling of zero-divisor graphs of finite commutative rings
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- Distance two surjective labelling of paths and interval graphs
- L(h,1,1)-labeling of outerplanar graphs
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- L(3,1)-labeling of circulant graphs
- L(2,1)-labeling for brick product graphs
- L(2,1)-labeling of interval graphs
- A linear algorithm for radio k-coloring of powers of paths having small diameters
- Combinatorial optimization in system configuration design
- L(0,1)-labelling of permutation graphs
- Online coloring of disk graphs
- Facial \(L(2, 1)\)-edge-labelings of trees
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Computing L(p,1)-Labeling with Combined Parameters
- Exact square coloring of subcubic planar graphs
- Online coloring and L(2,1)-labeling of unit disk intersection graphs
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- scientific article; zbMATH DE number 7651161 (Why is no real title available?)
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
- L(2,1,1)-labeling of interval graphs
- scientific article; zbMATH DE number 6963895 (Why is no real title available?)
- List version of L(d,s)-labelings
- scientific article; zbMATH DE number 1433954 (Why is no real title available?)
- Acyclic, star and injective colouring: a complexity picture for H-free graphs
This page was built for publication: Approximations for -Colorings of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470433)
