Pages that link to "Item:Q858302"
From MaRDI portal
The following pages link to Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302):
Displayed 10 items.
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles (Q282304) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- A \((3,1)^*\)-choosable theorem on toroidal graphs (Q765376) (← links)
- A note on list improper coloring of plane graphs (Q1003695) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles (Q2341778) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518) (← links)
- Improper Choosability and Property B (Q5325946) (← links)