\(L(h,1)\)-labeling subclasses of planar graphs
From MaRDI portal
Publication:1881282
DOI10.1016/j.jpdc.2003.11.005zbMath1084.68089OpenAlexW1992507725MaRDI QIDQ1881282
Tiziana Calamoneri, Rossella Petreschi
Publication date: 4 October 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.11.005
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ \(L(p,q)\) labeling of \(d\)-dimensional grids ⋮ Surviving rate of graphs and firefighter problem ⋮ On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ \(\lambda\)-coloring matrogenic graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ Unnamed Item ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs ⋮ \(L(0,1)\)-labelling of permutation graphs ⋮ The surviving rate of an outerplanar graph for the firefighter problem ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ Chromatic number of square of maximal outerplanar graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ The \(L(2,1)\)-labeling of unigraphs ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Frequency assignment problem in networks with limited spectrum ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ \(L(h,1,1)\)-labeling of outerplanar graphs ⋮ Labeling trees with a condition at distance two ⋮ Some results on distance two labelling of outerplanar graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice ⋮ Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
This page was built for publication: \(L(h,1)\)-labeling subclasses of planar graphs
