Minimal non-1-planar graphs (Q2470008): 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/j.disc.2007.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063563598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the 6 color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Independent Sets in Map Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for 7-coloring 1-plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonadditivity of the 1-genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Struktur 1‐planarer Graphen / rank
 
Normal rank

Latest revision as of 16:42, 27 June 2024

scientific article
Language Label Description Also known as
English
Minimal non-1-planar graphs
scientific article

    Statements