Recognizing optimal 1-planar graphs in linear time (Q1702117): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Straight-Line RAC Drawing Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Planarity of Graphs with a Rotation System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of 1-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fan-planarity: properties and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu einem Sechsfarbenproblem von G. Ringel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über 1-optimale Graphen / 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: Enumeration of simple complete topological graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Density of Maximal 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of simple quadrangulations of the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing hole-free 4-map graphs in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density of straight-line 1-planar graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Right angle crossing graphs and 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing outer-1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fáry’s Theorem for 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: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Struktur 1‐planarer Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank
 
Normal rank

Latest revision as of 05:29, 15 July 2024

scientific article
Language Label Description Also known as
English
Recognizing optimal 1-planar graphs in linear time
scientific article

    Statements

    Recognizing optimal 1-planar graphs in linear time (English)
    0 references
    0 references
    28 February 2018
    0 references
    graph drawing
    0 references
    1-planar graphs
    0 references
    recognition algorithms
    0 references
    graph reduction systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references