Griggs and Yeh's conjecture and L(p,1)-labelings

DOI10.1137/090763998MaRDI QIDQ2902894zbMATH OpenOpenAlexWikidataFDO

Authors Frédéric Havet, Jean-Sébastien Sereni, Bruce Reed

Publication date 22 August 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/090763998

zbMATH Keywords

channel assignmentgeneralized coloringgraph coloringgraph labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 5763155
• Labeling planar graphs with a condition at distance two
• $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
• On the \(L(p,1)\)-labelling of graphs
• scientific article; zbMATH DE number 2016729

Cited in

(26)

• Optimal channel assignment and \(L(p,1)\)-labeling
• The List L(2, 1)-labeling of planar graphs
• On the \(L(2,1)\)-labelings of amalgamations of graphs
• The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups
• The list \(L(2,1)\)-labeling of planar graphs with large girth
• Optimal frequency assignment and planar list L(2, 1)-labeling
• Distance-constrained labellings of Cartesian products of graphs
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• The ^2 conjecture holds for graphs of small order
• A linear time algorithm for L(2,1)-labeling of trees
• Labeling crossed prisms with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs
• On the universality and extremality of graphs with a distance constrained colouring
• Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
• The minimum span of \(L(2,1)\)-labelings of generalized flowers
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
• On (s,t)-relaxed L(2,1)-labeling of graphs
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
• n-fold L(2, 1)-labelings of Cartesian product of paths and cycles
• Ld(2,1)-labeling on T-graphs
• A proof of a version of Griggs and Yeh's conjecture for L (2, 1)-labeling of iterated Mycielskians
• Irreducible no-hole colorability of circulant 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

This page was built for publication: Griggs and Yeh's conjecture and \(L(p,1)\)-labelings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902894)