A note on (3,1)^*-choosable toroidal graphs
From MaRDI portal
Publication:3534281
zbMATH Open1161.05038arXivmath/0609757MaRDI QIDQ3534281FDOQ3534281
Authors: Qinglin Roger Yu, Baogang Xu 
Publication date: 3 November 2008
Full work available at URL: https://arxiv.org/abs/math/0609757
Recommendations
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
- On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
Cited In (9)
- Improper choosability and property B
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
- A \((3,1)^*\)-choosable theorem on toroidal graphs
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
- Title not available (Why is that?)
- \((3,2)^{*}\)-choosability of triangle-free toroidal graphs
- Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs
This page was built for publication: A note on \((3,1)^*\)-choosable toroidal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534281)
