Colouring problems (Q1255499): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A digest of the four color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of six-dimensional tangential 2-block / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-Colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An attempt to understand the four color problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Imbedding of Linear Graphs in Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu Hadwigers Vermutung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweis einer Abschwächung der Hadwiger-Vermutung / rank
 
Normal rank

Latest revision as of 01:41, 13 June 2024

scientific article
Language Label Description Also known as
English
Colouring problems
scientific article

    Statements