Pages that link to "Item:Q1305526"
From MaRDI portal
The following pages link to The 4-choosability of plane graphs without 4-cycles (Q1305526):
Displaying 50 items.
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
- Choosability in signed planar graphs (Q896077) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- On weak flexibility in planar graphs (Q2093108) (← links)
- On sufficient conditions for planar graphs to be 5-flexible (Q2117537) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- On total chromatic number of planar graphs without 4-cycles (Q2372576) (← links)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Planar graphs without triangular 4-cycles are 3-choosable (Q2454484) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
- \((4,1)^*\)-choosability of planar graphs (Q2719962) (← links)
- The 4-choosability of planar graphs without 6-cycles (Q2760437) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
- Flexibility of planar graphs without 4-cycles (Q6621243) (← links)
