A survey on labeling graphs with a condition at distance two
From MaRDI portal
Publication:2497501
DOI10.1016/j.disc.2005.11.029zbMath1094.05047OpenAlexW2161972193MaRDI 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
Related Items (only showing first 100 items - show all)
Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ An \(O(n\log n)\) algorithm for finding edge span of cacti ⋮ The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees ⋮ \(L(2, 1)\)-labeling of circulant graphs ⋮ Pair \(L(2, 1)\)-labelings of infinite graphs ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ On \(L(2,1)\)-labelings of some products of oriented cycles ⋮ \((2,1)\)-total labeling of a class of subcubic graphs ⋮ An extremal problem on non-full colorable graphs ⋮ Radio graceful Hamming graphs ⋮ \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) ⋮ \(L(2,1)\)-labelings on the modular product of two graphs ⋮ \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs ⋮ Further results on the radio number of trees ⋮ Radio number for middle graph of paths ⋮ \(L(j,k)\)-labeling numbers of square of paths ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ Optimal L(j,k)-Edge-Labeling of Regular Grids ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ \(L(p,2,1)\)-labeling of the infinite regular trees ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ Weighted improper colouring ⋮ \(L(0,1)\)-labelling of permutation graphs ⋮ 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 ⋮ The lambda number of the power graph of a finite \(p\)-group ⋮ Group path covering and distance two labeling of graphs ⋮ Labeling matched sums with a condition at distance two ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs ⋮ Radio number for total graph of paths ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ Distance two edge labelings of lattices ⋮ \((p,q)\)-total labeling of complete graphs ⋮ A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ The game \(L(d,1)\)-labeling problem of graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ Randomly colouring graphs (a combinatorial view) ⋮ \(L(2,1)\)-labeling of oriented planar graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 ⋮ \(\lambda\)-numbers of several classes of snarks ⋮ Optimal radio labellings of block graphs and line graphs of trees ⋮ \(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 ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Fast Exact Algorithm for L(2,1)-Labeling of Graphs ⋮ On a distance-constrained graph labeling to model cooperation ⋮ 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 ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ 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 ⋮ 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 ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total 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 real number labelings and graph invertibility ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ Anti-\(k\)-labeling of graphs ⋮ Lambda number of the power graph of a finite group ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ L(h,k)-labelling for octagonal grid ⋮ Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) ⋮ 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 ⋮ \(L(h,1,1)\)-labeling of outerplanar graphs ⋮ \(L(h,k)\)-labelings of Hamming graphs ⋮ On \(L(2 , 1)\)-labelings of oriented 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(p, q)\)-labeling of planar graphs with small girth ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures ⋮ On \((d,1)\)-total numbers of graphs ⋮ A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\) ⋮ Distance three labellings for K n ×K 2 ⋮ 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
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
- 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
- Graph labeling and radio channel assignment
- 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
This page was built for publication: A survey on labeling graphs with a condition at distance two
