Pages that link to "Item:Q1881282"

The following pages link to \(L(h,1)\)-labeling subclasses of planar graphs (Q1881282):

Displaying 38 items.

• A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
• On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice (Q324981) (← 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)
• The surviving rate of an outerplanar graph for the firefighter problem (Q627197) (← links)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
• Sharp bounds for Zagreb indices of maximal outerplanar graphs (Q719030) (← links)
• \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
• \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
• \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
• Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
• Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
• Frequency assignment problem in networks with limited spectrum (Q1788938) (← links)
• On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← 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)
• On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
• Surviving rate of graphs and firefighter problem (Q2141321) (← links)
• Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
• The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice (Q2343988) (← links)
• Optimal \(L(3, 2, 1)\)-labeling of triangular lattice (Q2357158) (← links)
• \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (Q2445232) (← links)
• Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
• A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
• \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
• Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
• (Q4965620) (← links)
• DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE (Q5217048) (← links)
• Labeling trees with a condition at distance two (Q5920600) (← links)
• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus (Q5963610) (← links)
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
• \(L(3, 2, 1)\)-labeling of certain planar graphs (Q6646440) (← links)