On the \(L(p,1)\)-labelling of graphs
From MaRDI portal
Publication:2476282
DOI10.1016/j.disc.2007.07.075zbMath1135.05065OpenAlexW1983030532MaRDI QIDQ2476282
Publication date: 18 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.075
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (44)
Optimal channel assignment and \(L(p,1)\)-labeling ⋮ Computing L(p,1)-Labeling with Combined Parameters ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ L(3,1)-labeling of circulant graphs ⋮ \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs ⋮ Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles ⋮ \(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 ⋮ Some results on the injective chromatic number of graphs ⋮ On \(L(2,1)\)-labeling of generalized Petersen graphs ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs ⋮ \(L(0,1)\)-labelling of permutation graphs ⋮ L(2,1,1)-labeling of interval graphs ⋮ Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips ⋮ \(L(2,1)\)-labelling of generalized prisms ⋮ On the \(L(2,1)\)-labelings of amalgamations of graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups ⋮ \(L(p,q)\)-labeling of sparse graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Determining the \(L(2,1)\)-span in polynomial space ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ On theL(2, 1)-labelling of block graphs ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ \(L(2,1)\)-labeling of interval graphs ⋮ \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs ⋮ \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs ⋮ \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs ⋮ Anti-\(k\)-labeling of graphs ⋮ The list \(L(2,1)\)-labeling of planar graphs with large girth ⋮ Distance two surjective labelling of paths and interval graphs ⋮ Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two ⋮ Linear and cyclic distance-three labellings of trees ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ \( L ( 2 , 1 )\)-labeling of disk intersection graphs ⋮ Optimal frequency assignment and planar list \(L(2, 1)\)-labeling ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
Cites Work
- Unnamed Item
- On distance constrained labeling of disk graphs
- On \(L(d,1)\)-labelings of graphs
- On the span in channel assignment problems: Bounds, computing and counting
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- A bound on the chromatic number of the square of a planar graph
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Coloring the square of a planar graph
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Coloring Powers of Chordal Graphs
- Graph colouring and the probabilistic method
This page was built for publication: On the \(L(p,1)\)-labelling of graphs
