Pages that link to "Item:Q2485944"

The following pages link to A bound on the chromatic number of the square of a planar graph (Q2485944):

Displaying 50 items.

• On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
• The square of a planar cubic graph is 7-colorable (Q1682215) (← links)
• 3-dynamic coloring of planar triangulations (Q1783610) (← links)
• An optimal square coloring of planar graphs (Q1928491) (← links)
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
• The complexity of frugal colouring (Q2023759) (← links)
• The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
• Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
• \(2\)-distance coloring of planar graphs with maximum degree \(5\) (Q2075520) (← links)
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
• A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
• Wegner's conjecture on 2-distance coloring (Q2151384) (← links)
• Wegner's conjecture on 2-distance coloring for planar graphs (Q2152439) (← links)
• List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
• Sharp upper bound of injective coloring of planar graphs with girth at least 5 (Q2165276) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• A note on the chromatic number of the square of Kneser graph \(K(2 k + 1, k)\) (Q2279276) (← links)
• 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
• Linear-time algorithms for tree root problems (Q2346968) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\) (Q2411599) (← links)
• Coloring squares of planar graphs with girth six (Q2427536) (← links)
• A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
• \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
• Labeling planar graphs with a condition at distance two (Q2461777) (← links)
• \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← 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)
• Coloring the square of an outerplanar graph (Q2472571) (← links)
• On the \(L(p,1)\)-labelling of graphs (Q2476282) (← links)
• The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
• Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
• Improved square coloring of planar graphs (Q2685324) (← links)
• Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
• Brooks-type theorem for \(r\)-hued coloring of graphs (Q2696623) (← links)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
• 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
• List 2-distance coloring of planar graphs without short cycles (Q2798330) (← links)
• New upper bound on the chromatic number of the square of a planar graph (Q2824258) (← links)
• An upper bound of linear chromatic number of planar graphs (Q2916456) (← 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)
• On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
• List Colouring Squares of Planar Graphs (Q3503513) (← links)
• Conflict-Free Colourings of Graphs and Hypergraphs (Q3552506) (← links)
• 2-Distance coloring of planar graph (Q5012803) (← links)
• 2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121) (← links)
• 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles (Q5232154) (← links)
• 2-Distance chromatic number of some graph products (Q5854751) (← links)