Pages that link to "Item:Q4797924"

The following pages link to Coloring the square of a planar graph (Q4797924):

Displayed 15 items.

• The \(L(2,1)\)-labeling on planar graphs (Q868019) ‎ (← links)
• Linear choosability of graphs (Q932648) ‎ (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) ‎ (← links)
• Coloring the square of a \(K_{4}\)-minor free graph (Q1402088) ‎ (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) ‎ (← links)
• Coloring squares of planar graphs with girth six (Q2427536) ‎ (← links)
• Labelling of some planar graphs with a condition at distance two (Q2454996) ‎ (← links)
• Labeling planar graphs with a condition at distance two (Q2461777) ‎ (← links)
• On the existence of specific stars in planar graphs (Q2464048) ‎ (← links)
• Chromatic number of square of maximal outerplanar graphs (Q2466444) ‎ (← links)
• A survey on the distance-colouring of graphs (Q2468029) ‎ (← links)
• On the \(L(p,1)\)-labelling of graphs (Q2476282) ‎ (← links)
• A bound on the chromatic number of the square of a planar graph (Q2485944) ‎ (← links)
• The \(L(2,1)\)-labelling of trees (Q2489954) ‎ (← 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)