A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\) (Q2552508): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(72)90042-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005196216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Genus of the <i>n</i>-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal crossing number of Km,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal crossing number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Das Geschlecht des vollständigen paaren Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3847965 / rank
 
Normal rank

Latest revision as of 10:09, 12 June 2024

scientific article
Language Label Description Also known as
English
A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
scientific article

    Statements

    Identifiers