On the L(p,1)-labelling of graphs

DOI10.1016/J.DISC.2007.07.075zbMATH Open1135.05065OpenAlexW1983030532MaRDI QIDQ2476282FDOQ2476282

Authors: Daniel Gonçalves 

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

Recommendations

• Optimal channel assignment and \(L(p,1)\)-labeling
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• \(L(p,q)\)-labelling of planar graphs with high maximum degree
• The \(L(d_1,d_2)\)-labeling problem on graphs
• The \(L(3,2,1)\)-labeling problem on graphs

zbMATH Keywords

channel assignment problem\(L(pq)\)-labelling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• Graph colouring and the probabilistic method
• 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
• Coloring the square of a planar graph
• The $L(2,1)$-Labeling Problem on Graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On \(L(d,1)\)-labelings of graphs
• Labeling Chordal Graphs: Distance Two Condition
• A Theorem about the Channel Assignment Problem
• On distance constrained labeling of disk graphs
• Title not available (Why is that?)
• Coloring Powers of Chordal Graphs

Cited In (64)

• \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
• Determining the \(L(2,1)\)-span in polynomial space
• Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
• Graphs without gap-vertex-labellings: families and bounds
• Online coloring of disk graphs
• Computing L(p,1)-Labeling with Combined Parameters
• L(2,1,1)-labeling of interval graphs
• \(L(3, 2, 1)\)-labeling problem of square of path
• \((p,1)\)-total labelling of graphs
• \( L ( p , q )\)-labelings of subdivisions of graphs
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• 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
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• \(L(2,1)\)-labelling of generalized prisms
• On \(L(d,1)\)-labelings of graphs
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
• On oriented \(L(p,1)\)-labeling
• Computing \(L(p, 1)\)-labeling with combined parameters
• Title not available (Why is that?)
• Optimal channel assignment and \(L(p,1)\)-labeling
• On \((p, 1)\)-total labelling of NIC-planar graphs
• A note on collections of graphs with non-surjective lambda labelings
• 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)-coloring and irreducible no-hole coloring of lexicographic product of graphs
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs
• Randomly colouring graphs (a combinatorial view)
• Title not available (Why is that?)
• On \((p,1)\)-total labelling of special 1-planar graphs.
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Title not available (Why is that?)
• Anti-\(k\)-labeling of graphs
• Labelled Graphs with Small Vertex Degrees and P-Recursiveness
• On the universality and extremality of graphs with a distance constrained colouring
• Linear and cyclic distance-three labellings of trees
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• \(L(3,1)\)-labeling of circulant graphs
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• Distance two surjective labelling of paths and interval graphs
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• The List \(L(2, 1)\)-labeling of planar graphs
• \(L(2,1)\)-labeling of interval graphs
• \(L(p,q)\)-labeling of digraphs
• \(L(0,1)\)-labelling of permutation 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
• Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
• \(L(p,q)\)-labeling of sparse graphs
• \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs
• Starter labelling of \(k\)-windmill graphs with small defects
• \(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
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs

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)