Pages that link to "Item:Q2397522"
From MaRDI portal
The following pages link to Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522):
Displaying 18 items.
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← 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)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- The 4-choosability of planar graphs without 6-cycles (Q2760437) (← links)
- 不含3圈和4圈的1-平面图是5-可染的 (Q3131939) (← links)
- Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
