A survey on labeling graphs with a condition at distance two
From MaRDI portal
Publication:2497501
DOI10.1016/j.disc.2005.11.029zbMath1094.05047MaRDI QIDQ2497501
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.029
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
On (s,t)-relaxed L(1,1)-labelling of trees, On irreducible no‐hole L(2, 1)‐coloring of trees, On circular-L(2, 1)-labellings of products of graphs, Radio number of trees, Radio number of trees, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, \(L(2,1)\)-labeling for brick product graphs, \(L(j,k)\)-labeling number of Cartesian product of path and cycle, An \(O(n\log n)\) algorithm for finding edge span of cacti, \((2,1)\)-total labeling of a class of subcubic graphs, Radio graceful Hamming graphs, \(L(2,1)\)-labelings on the modular product of two graphs, Fast exact algorithm for \(L(2,1)\)-labeling of graphs, \(L(p,2,1)\)-labeling of the infinite regular trees, The \((p,q)\)-total labeling problem for trees, Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips, \(L(2,1)\)-labelling of generalized prisms, Distance three labelings of trees, \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs, A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs, The game \(L(d,1)\)-labeling problem of graphs, Randomly colouring graphs (a combinatorial view), \(L(2,1)\)-labelings of subdivisions of graphs, The minimum span of \(L(2,1)\)-labelings of generalized flowers, \(\lambda\)-numbers of several classes of snarks, \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle, \(L(2,1)\)-labeling of interval graphs, Price of anarchy for graph coloring games with concave payoff, A note on \(L (2, 1)\)-labelling of trees, \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs, On \((p,1)\)-total labelling of planar graphs, \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle, New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs, Parameterized complexity of coloring problems: treewidth versus vertex cover, The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs, \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\), \(L(2,1)\)-labeling of perfect elimination bipartite graphs, On \((p,1)\)-total labelling of 1-planar graphs, On real number labelings and graph invertibility, On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs, Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two, Nordhaus-Gaddum-type relations of three graph coloring parameters, On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles, An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees, \(L(0,1)\)-labelling of permutation graphs, Complexity of (p,1)-total labelling, Labeling the \(r\)-path with a condition at distance two, On island sequences of labelings with a condition at distance two, \(L(j,k)\)-labelling and maximum ordering-degrees for trees, Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\), \(L(h,1,1)\)-labeling of outerplanar graphs, \(L(h,k)\)-labelings of Hamming 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, On \((d,1)\)-total numbers of graphs, On \(L(2,1)\)-labeling of generalized Petersen graphs, Weighted improper colouring, Group path covering and distance two labeling of graphs, On the \(L(2,1)\)-labelings of amalgamations of graphs, Radio number for total graph of paths, Distance two edge labelings of lattices, \((p,q)\)-total labeling of complete graphs, Lambda number for the direct product of some family of graphs, Multiple \(L(j,1)\)-labeling of the triangular lattice, \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs, On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice, 2-distance colorings of some direct products of paths and cycles, \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs, Radio number for the product of a path and a complete graph, Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees, The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs, A linear time algorithm for \(L(2,1)\)-labeling of trees, An extremal problem on non-full colorable graphs, \(L(j, k)\)-number of direct product of path and cycle, Labeling matched sums with a condition at distance two, Circular \(L(j,k)\)-labeling number of direct product of path and cycle, On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice, \(L(2,1)\)-labeling of oriented planar graphs, Path covering number and \(L(2,1)\)-labeling number of graphs, On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs, \(L(1, 2)\)-edge-labelings for lattices, L(h,k)-labelling for octagonal grid, Distance three labellings for K n ×K 2, Optimal L(j,k)-Edge-Labeling of Regular Grids, The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2, Fast Exact Algorithm for L(2,1)-Labeling of Graphs, Distance Constrained Labelings of Trees, An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relating path coverings to vertex labellings with a condition at distance two
- Labeling trees with a condition at distance two.
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- No-hole \(L(2,1)\)-colorings
- On \(L(d,1)\)-labelings of graphs
- Colouring weighted bipartite graphs with a co-site constraint
- Labelling graphs with the circular difference
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On generalized Petersen graphs labeled with a condition at distance two
- Distance-two labelings of graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- The L(2,1)-labeling and operations of graphs
- On labeling the vertices of products of complete graphs with distance constraints
- Graph distance‐dependent labeling related to code assignment in computer networks
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Labeling trees with a condition at distance two
- The edge span of distance two labellings of graphs
- Hamiltonicity and circular distance two labellings
