Pages that link to "Item:Q1402088"

The following pages link to Coloring the square of a \(K_{4}\)-minor free graph (Q1402088):

Displaying 45 items.

• On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) (← links)
• Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
• \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
• A note on 2-facial coloring of plane graphs (Q844207) (← links)
• On \(r\)-hued coloring of planar graphs with girth at least 6 (Q897613) (← links)
• List-colouring the square of a \(K_4\)-minor-free graph (Q941324) (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
• Oriented colorings of partial 2-trees (Q975406) (← links)
• Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
• Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
• A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs (Q1045198) (← links)
• Hadwiger's conjecture for squares of 2-trees (Q1633613) (← links)
• Injective coloring of some graph operations (Q1659655) (← links)
• List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
• Signature of power graphs (Q1743077) (← links)
• Upper bounds of \(r\)-hued colorings of planar graphs (Q1752467) (← links)
• Some results on the injective chromatic number of graphs (Q1928520) (← links)
• The complexity of frugal colouring (Q2023759) (← links)
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs (Q2065804) (← links)
• 2-distance list \((\varDelta +3)\)-coloring of sparse graphs (Q2084788) (← links)
• 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 (Q2165285) (← links)
• Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
• Facial edge-face coloring of \(K_4\)-minor-free graphs (Q2174603) (← links)
• Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs (Q2189858) (← links)
• \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
• Edge-partition and star chromatic index (Q2335139) (← links)
• Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← links)
• Odd induced subgraphs in graphs with treewidth at most two (Q2413620) (← links)
• List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs (Q2414472) (← links)
• Bounding the chromatic number of squares of \(K_4\)-minor-free graphs (Q2421854) (← links)
• A unified approach to distance-two colouring of graphs on surfaces (Q2439826) (← links)
• Chromatic number of square of maximal outerplanar graphs (Q2466444) (← links)
• A survey on the distance-colouring of graphs (Q2468029) (← links)
• Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← 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)
• Oriented vertex and arc colorings of partial 2-trees (Q3503473) (← links)
• Straight-line monotone grid drawings of series–parallel graphs (Q5261041) (← links)
• The list 2-distance coloring of a graph with Δ(G) = 5 (Q5261051) (← links)
• Coloring squares of graphs via vertex orderings (Q5859506) (← links)
• Homomorphisms of 2-edge-colored graphs (Q5901070) (← links)
• Injective coloring of planar graphs (Q5902135) (← links)
• Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
• 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
• 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method (Q6635121) (← links)