On the L(p,1)-labelling of graphs
From MaRDI portal
Publication:2476282
Recommendations
Cites work
- scientific article; zbMATH DE number 5763155 (Why is no real title available?)
- A Theorem about the Channel Assignment Problem
- A bound on the chromatic number of the square of a planar graph
- Coloring Powers of Chordal Graphs
- Coloring the square of a planar graph
- Graph colouring and the probabilistic method
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- On \(L(d,1)\)-labelings of graphs
- On distance constrained labeling of disk graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- On the span in channel assignment problems: Bounds, computing and counting
- The $L(2,1)$-Labeling Problem on Graphs
- \(L(p,q)\) labeling of \(d\)-dimensional grids
Cited in
(64)- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- \((p,1)\)-total labelling of graphs
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- \( L ( p , q )\)-labelings of subdivisions of graphs
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
- On the \(L(2, 1)\)-labelling of block graphs
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Determining the \(L(2,1)\)-span in polynomial space
- L(2,1)-labelling of generalized prisms
- Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- On \(L(d,1)\)-labelings of graphs
- On oriented \(L(p,1)\)-labeling
- Computing \(L(p, 1)\)-labeling with combined parameters
- scientific article; zbMATH DE number 5812224 (Why is no real title available?)
- Optimal channel assignment and \(L(p,1)\)-labeling
- A note on collections of graphs with non-surjective lambda labelings
- On \((p, 1)\)-total labelling of NIC-planar graphs
- Some results on the injective chromatic number of graphs
- Labeling the \(r\)-path with a condition at distance two
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- L(2,1)-labeling of perfect elimination bipartite graphs
- Randomly colouring graphs (a combinatorial view)
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
- scientific article; zbMATH DE number 5026592 (Why is no real title available?)
- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
- On \((p,1)\)-total labelling of special 1-planar graphs.
- Graphs without gap-vertex-labellings: families and bounds
- scientific article; zbMATH DE number 5237265 (Why is no real title available?)
- Anti-\(k\)-labeling of graphs
- Linear and cyclic distance-three labellings of trees
- The L(p, q)-labelling of planar graphs without 4-cycles
- Labelled Graphs with Small Vertex Degrees and P-Recursiveness
- On the universality and extremality of graphs with a distance constrained colouring
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- Distance two surjective labelling of paths and interval graphs
- The List L(2, 1)-labeling of planar graphs
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- \(L(3,1)\)-labeling of circulant graphs
- L(2,1)-labeling of interval graphs
- \(L(p,q)\)-labeling of digraphs
- L(0,1)-labelling of permutation graphs
- Online coloring of disk graphs
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
- L(p,q)-label coloring problem with application to channel allocation
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
- \(L(p,q)\)-labeling of sparse graphs
- Computing L(p,1)-Labeling with Combined Parameters
- Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
- Starter labelling of \(k\)-windmill graphs with small defects
- \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
- L(2,1,1)-labeling of interval graphs
- L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling
- On the \(L(2,1)\)-labelings of amalgamations of graphs
- L(2,1)-labelings on the modular product of two graphs
- \(L(3, 2, 1)\)-labeling problem of square of path
This page was built for publication: On the \(L(p,1)\)-labelling of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476282)
