On the \lambda-Number of Q_n and Related Graphs
From MaRDI portal
Publication:4863972
Recommendations
Cited in
(88)- A distance-labelling problem for hypercubes
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- L(h,k)-labelings of Hamming graphs
- Some results on distance two labelling of outerplanar graphs
- On \((d,1)\)-total numbers of graphs
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- No-hole \(L(2,1)\)-colorings
- Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph
- \(L(2,1)\)-labeling of direct product of paths and cycles
- A note on collections of graphs with non-surjective lambda labelings
- On L(2,1)-labelings of Cartesian products of paths and cycles
- Distance-two labelings of graphs
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- (p,q)-total labeling of complete graphs
- Lambda number for the direct product of some family of graphs
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- Lambda number of the power graph of a finite group
- Distance-constrained labellings of Cartesian products of graphs
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- 2-distance colorings of some direct products of paths and cycles
- \((2,1)\)-total labeling of trees with large maximum degree
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\)
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- L(p,q) labeling of d-dimensional grids
- (d,1)-total labelling of planar graphs with large girth and high maximum degree
- \(L(j, k)\)-number of direct product of path and cycle
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
- List backbone colouring of graphs
- Path covering number and \(L(2,1)\)-labeling number of graphs
- \((2,1)\)-total labelling of outerplanar graphs
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- \((p,1)\)-total labelling of graphs
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- On the \(L(p,1)\)-labelling of graphs
- A bound on the chromatic number of the square of a planar graph
- The L(2,1)-labelling of trees
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- A survey on labeling graphs with a condition at distance two
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- \( L ( p , q )\)-labelings of subdivisions of graphs
- On irreducible no-hole L(2, 1)-labelings of hypercubes and triangular lattices
- \(L(h, k)\)-labelling for octagonal grid
- A q-analogue of the addressing problem of graphs by Graham and Pollak
- The \((2,1)\)-total labeling number of outerplanar graphs is at most \(\Delta + 2\)
- (2,1)-total labeling of a class of subcubic graphs
- scientific article; zbMATH DE number 5669517 (Why is no real title available?)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Backbone coloring for graphs with large girths
- L(d,1)-labelings of the edge-path-replacement of a graph
- The (p,q)-total labeling problem for trees
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
- A Radio Coloring of a Hypercube
- scientific article; zbMATH DE number 5869 (Why is no real title available?)
- \(L(2,1)\)-labelings of subdivisions of graphs
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
- On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
- On \((p,1)\)-total labelling of planar graphs
- scientific article; zbMATH DE number 5263356 (Why is no real title available?)
- On critical trees labeled with a condition at distance two
- Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
- Labeling trees with a condition at distance two
- Fixed-parameter complexity of \(\lambda\)-labelings
- L(2,1)-labelings of the edge-multiplicity-paths-replacement of a graph
- L(2,1)-labeling for brick product graphs
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- On (p,1)-total labelling of 1-planar graphs
- L(2,1)-labeling of some zero-divisor graphs associated with commutative rings
- (d,1)-total labellings of two infinite families of snarks
- Lambda number of the enhanced power graph of a finite group
- Toward optimal radio colorings of hypercubes via SAT-solving
- Coloring the square of the Cartesian product of two cycles
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Acyclic colorings of products of trees
- The 2-dipath chromatic number of Halin graphs
- Distance-two labelings of digraphs
- Improved upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
- Distance two labelling and direct products of graphs
- Labelling planar graphs without 4-cycles with a condition on distance two
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- \((2,1)\)-Total number of trees with maximum degree three
This page was built for publication: On the $\lambda$-Number of $Q_n $ and Related Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863972)
