The 4-choosability of toroidal graphs without intersecting triangles (Q845970): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4719323 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Choosability of toroidal graphs without short cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar graph is 5-choosable / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3115277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: List colourings of planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles / rank | |||
Normal rank |
Latest revision as of 10:59, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The 4-choosability of toroidal graphs without intersecting triangles |
scientific article |
Statements
The 4-choosability of toroidal graphs without intersecting triangles (English)
0 references
29 January 2010
0 references
toroidal graph
0 references
choosability
0 references
list coloring
0 references
cycle
0 references
combinatorial problems
0 references