Fan-planarity: properties and complexity (Q2346379): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs That Admit Polyline Drawings with Few Crossing Angles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number ofK1,3,n andK2,3,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Outer 1-Planar Graphs in Linear Time / 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-Planar Graphs: Combinatorial Properties and Complexity Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über 1-optimale Graphen / 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: On the Number of Edges of Fan-Crossing Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-planarity of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-layer right angle crossing drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area, curve complexity, and crossing resolution of non-planar graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement of graph drawings with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way / 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: Drawing graphs with right angle crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Crossing-Angle Resolution in Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on large angle crossing graphs / 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: Confluent layered drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / 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: 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: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph crossing number and its variants: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal 1-planar graphs which triangulate other surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embeddings of Maximum 1-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geometric graphs with no \(k\) pairwise parallel edges / rank
 
Normal rank

Latest revision as of 04:32, 10 July 2024

scientific article
Language Label Description Also known as
English
Fan-planarity: properties and complexity
scientific article

    Statements

    Fan-planarity: properties and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    graph planarity
    0 references
    graph drawing
    0 references
    edge crossings
    0 references
    edge density
    0 references
    0 references
    0 references