Pages that link to "Item:Q3583295"
From MaRDI portal
The following pages link to Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295):
Displayed 16 items.
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← 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)
- Cover and variable degeneracy (Q2075519) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← 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)
- Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)