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