Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Contractible edges in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex types and cyclic colourings of 3-connected plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structure of some plane graphs with application to choosability / 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: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Improper 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
Property / cites work
 
Property / cites work: \((4m,m)\)-choosability of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability / rank
 
Normal rank

Latest revision as of 10:58, 25 June 2024

scientific article
Language Label Description Also known as
English
Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
scientific article

    Statements

    Identifiers