Pages that link to "Item:Q1892853"

The following pages link to 3-list-coloring planar graphs of girth 5 (Q1892853):

Displaying 50 items.

• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
• From the plane to higher surfaces (Q444375) (← links)
• 5-choosability of graphs with crossings far apart (Q505910) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
• A note on group choosability of graphs with girth at least 4 (Q659688) (← links)
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
• Planar graphs without cycles of specific lengths (Q697075) (← links)
• Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
• Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
• A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
• A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
• Many 3-colorings of triangle-free planar graphs (Q875936) (← links)
• A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
• Choosability in signed planar graphs (Q896077) (← links)
• On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
• A relaxation of Havel's 3-color problem (Q963412) (← links)
• On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
• The complexity of planar graph choosability (Q1126188) (← links)
• The list chromatic numbers of some planar graphs (Q1288297) (← links)
• The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
• The chromatic number of a graph of girth 5 on a fixed surface (Q1403910) (← links)
• A short list color proof of Grötzsch's theorem (Q1405112) (← links)
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
• DP-3-coloring of some planar graphs (Q1618234) (← links)
• Choice numbers of multi-bridge graphs (Q1650388) (← links)
• On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381) (← links)
• The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
• Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
• On structure of some plane graphs with application to choosability (Q1850547) (← links)
• A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
• Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
• On group choosability of graphs. II (Q2014707) (← links)
• DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
• A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
• Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
• On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
• Planar graphs without normally adjacent short cycles (Q2144582) (← links)
• Flow extensions and group connectivity with applications (Q2198992) (← links)
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
• 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
• Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)