The Independence Ratio and Genus of a Graph (Q4124854): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A lower bound for the independence number of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence ratio of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of an independent set in a nonplanar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Proof of a Map-Colour Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inégalités nouvelles dans le problème des quatre couleurs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank

Latest revision as of 21:07, 12 June 2024

scientific article; zbMATH DE number 3550734
Language Label Description Also known as
English
The Independence Ratio and Genus of a Graph
scientific article; zbMATH DE number 3550734

    Statements