ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper Colourings of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Grötzsch-Type Theorem for List Colourings with Impropriety One / rank
 
Normal rank
Property / cites work
 
Property / cites work: List improper colorings of planar graphs with prescribed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on list improper coloring of plane graphs / rank
 
Normal rank

Revision as of 23:19, 1 July 2024

scientific article
Language Label Description Also known as
English
ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
scientific article

    Statements

    Identifiers