Labelling Graphs with a Condition at Distance 2
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- A distance-labelling problem for hypercubes
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- L(h,1,1)-labeling of outerplanar graphs
- L(h,k)-labelings of Hamming graphs
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- Labeling bipartite permutation graphs with a condition at distance two
- Distance-two labellings of Hamming graphs
- Combinatorial optimization in system configuration design
- Some results on distance two labelling of outerplanar graphs
- \(L(2,1)\)-labeling of strong products of cycles
- On \((d,1)\)-total numbers of graphs
- -backbone colorings along pairwise disjoint stars and matchings
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Relating path coverings to vertex labellings with a condition at distance two
- The total graph of a hypergraph
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- No-hole \(L(2,1)\)-colorings
- Greedy \(F\)-colorings of graphs
- Algorithms for graphs with small octopus
- Optimal channel assignment and \(L(p,1)\)-labeling
- \(L(2, 1)\)-labeling of circulant graphs
- Pair \(L(2, 1)\)-labelings of infinite graphs
- Computing a minimum paired-dominating set in strongly orderable graphs
- The List L(2, 1)-labeling of planar graphs
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
- Facial \(L(2, 1)\)-edge-labelings of trees
- On the \(L\)(2,~1)-labeling conjecture for brick product graphs
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
- Infinitely many trees with maximum number of holes zero, one, and two
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
- Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- On the number of 2-packings in a connected graph
- Systems of distant representatives
- \(L(2,1)\)-labeling of direct product of paths and cycles
- An exact algorithm for the channel assignment problem
- A note on collections of graphs with non-surjective lambda labelings
- Generalized list \(T\)-colorings of cycles
- Theory of computational complexity. Part 7. Transl. from the Russian
- Frequency assignment problem in networks with limited spectrum
- On L(2,1)-labelings of Cartesian products of paths and cycles
- Distance-two labelings of graphs
- A channel assignment problem for optical networks modelled by Cayley graphs
- Some results on the injective chromatic number of graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- Group path covering and distance two labeling of graphs
- On the complexity of exact algorithm for L(2,1)-labeling of graphs
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- Radio number for total graph of paths
- New results in \(t\)-tone coloring of graphs
- The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
- L(p,q)-labeling of sparse graphs
- Distance two edge labelings of lattices
- (p,q)-total labeling of complete graphs
- Antipodal number of full \(m\)-ary trees
- Lambda number for the direct product of some family of graphs
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- Multiple L(j,1)-labeling of the triangular lattice
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- The complexity of frugal colouring
- On \(L(h,k)\)-labeling index of inverse graphs associated with finite cyclic groups
- Frequency assignment model of zero divisor graph
- Lambda number of the power graph of a finite group
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Distance two surjective labelling of paths and interval graphs
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
- Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
- On \(L(2 , 1)\)-labelings of oriented graphs
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- \(2\)-distance coloring of planar graphs with maximum degree \(5\)
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- Optimal frequency assignment and planar list L(2, 1)-labeling
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Radio and radial radio numbers of certain sunflower extended graphs
- A new approach on locally checkable problems
- Radio-\(k\)-labeling of cycles for large \(k\)
- Wegner's conjecture on 2-distance coloring
- The complexity of \(L(p, q)\)-edge-labelling
- New results on radio \(k\)-labelings of distance graphs
- List covering of regular multigraphs
- On some \(L(2, 1)\)-coloring parameters of certain graph classes
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- Improved lower bounds for the radio number of trees
- On \((p, 1)\)-total labelling of some 1-planar graphs
- Distance-constrained labellings of Cartesian products of graphs
- Computing \(L(p, 1)\)-labeling with combined parameters
- Optimal radio labellings of block graphs and line graphs of trees
- On a distance-constrained graph labeling to model cooperation
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
- The \(L(2,1)\)-labeling of unigraphs
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\)
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- Anti-\(k\)-labeling of graphs
- The k-distance chromatic number of trees and cycles
- Subexponential algorithms for variants of the homomorphism problem in string graphs
This page was built for publication: Labelling Graphs with a Condition at Distance 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030197)
