scientific article
From MaRDI portal
Publication:3576665
zbMath1192.05134MaRDI QIDQ3576665
Publication date: 30 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0117/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (15)
A new approach on locally checkable problems ⋮ The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) ⋮ Exact algorithms for \(L(2,1)\)-labeling of graphs ⋮ The game \(L(d,1)\)-labeling problem of graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ Labeling planar graphs with a condition at distance two ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
This page was built for publication:
