1-planarity of complete multipartite graphs (Q412349): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new proof of the 6 color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936748 / 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: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4669418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of \(K_{1,4,n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene / rank
 
Normal rank

Latest revision as of 03:03, 5 July 2024

scientific article
Language Label Description Also known as
English
1-planarity of complete multipartite graphs
scientific article

    Statements

    Identifiers