Griggs and Yeh's Conjecture and $L(p,1)$-labelings
From MaRDI portal
Publication:2902894
DOI10.1137/090763998zbMath1245.05110OpenAlexW2047165588WikidataQ123012984 ScholiaQ123012984MaRDI QIDQ2902894
Jean-Sébastien Sereni, Frédéric Havet, Bruce A. 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
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Optimal channel assignment and \(L(p,1)\)-labeling, A linear time algorithm for \(L(2,1)\)-labeling of trees, The List \(L(2, 1)\)-labeling of planar graphs, Computational complexity of distance edge labeling, Labeling crossed prisms with a condition at distance two, 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, On the \(L(2,1)\)-labelings of amalgamations of graphs, The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups, The minimum span of \(L(2,1)\)-labelings of generalized flowers, Distance-constrained labellings of Cartesian products of graphs, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, The list \(L(2,1)\)-labeling of planar graphs with large girth, 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, THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE, \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
