Pages that link to "Item:Q2497501"

The following pages link to A survey on labeling graphs with a condition at distance two (Q2497501):

Displaying 50 items.

• An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• Radio graceful Hamming graphs (Q339492) (← links)
• \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
• \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
• \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
• Distance three labelings of trees (Q415278) (← links)
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• \(\lambda\)-numbers of several classes of snarks (Q489727) (← 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)
• Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
• On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle (Q514887) (← links)
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
• Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• On real number labelings and graph invertibility (Q713307) (← links)
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← links)
• Nordhaus-Gaddum-type relations of three graph coloring parameters (Q741774) (← links)
• On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
• \(L(p, q)\)-labeling of planar graphs with small girth (Q777443) (← links)
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
• \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
• Complexity of (p,1)-total labelling (Q967327) (← links)
• Labeling the \(r\)-path with a condition at distance two (Q967377) (← links)
• On island sequences of labelings with a condition at distance two (Q968105) (← links)
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
• Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) (Q1003771) (← links)
• \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
• \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← 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)
• On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
• \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)