The 4-choosability of toroidal graphs without intersecting triangles
From MaRDI portal
Recommendations
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- (3, 1)-choosability of toroidal graphs with some forbidden short cycles
- On \((4,1)^*\)-choosability of toroidal graphs without chordal 7-cycles and adjacent 4-cycles
- Edge choosablity and total choosability of toroidal graphs without intersecting triangles.
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- Choosability of toroidal graphs without short cycles
- Dirac's map-color theorem for choosability
- Every planar graph is 5-choosable
- List colourings of planar graphs
- Multicriterial graph problems with MAXMIN criterion
Cited in
(8)- Edge choosablity and total choosability of toroidal graphs without intersecting triangles.
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- DP-4-coloring of planar graphs with some restrictions on cycles
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- A new sufficient condition for a toroidal graph to be 4-choosable
- Toroidal graphs containing neither \(K_5^-\) nor 6-cycles are 4-choosable
- Cover and variable degeneracy
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
This page was built for publication: The 4-choosability of toroidal graphs without intersecting triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845970)
