Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs (Q2037549): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on group colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group connectivity and group coloring: small groups versus large groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows and modulo \(k\)-orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many 5-list-colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many 3-colorings of triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak 3-flow conjecture and the weak circular flow conjecture / rank
 
Normal rank

Latest revision as of 03:53, 26 July 2024

scientific article
Language Label Description Also known as
English
Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs
scientific article

    Statements

    Identifiers