The following pages link to (Q3576665):
Displaying 16 items.
- The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
- \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
- A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) (Q2411599) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
- 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 (Q3439631) (← links)
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles (Q6497036) (← links)
