Pages that link to "Item:Q1903746"
From MaRDI portal
The following pages link to A not 3-choosable planar graph without 3-cycles (Q1903746):
Displaying 50 items.
- 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
- On 3-choosability of triangle-free plane graphs (Q657261) (← 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)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← 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)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- The chromatic polynomial and list colorings (Q1003851) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- Choosability with union separation (Q1690218) (← links)
- Colouring of generalized signed triangle-free planar graphs (Q1712532) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
- 3-list-coloring planar graphs of girth 5 (Q1892853) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles (Q2099419) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← 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)
- A refinement of choosability of graphs (Q2284741) (← links)
- Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← links)
- Multiple list colouring triangle free planar graphs (Q2312604) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- On choosability with separation of planar graphs with lists of different sizes (Q2346342) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- On \(t\)-common list-colorings (Q2401414) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
