Gap-planar graphs (Q1786592): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Size of Planarly Connected Crossing Graphs / 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: On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs / 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: Gap-Planar Graphs / 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: On RAC drawings of 1-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guest Editors' Foreword and Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Density of Non-simple 3-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: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on Partial Edge Drawings / 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: Circular right-angle crossing drawings in linear time / 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: Structure of Graphs with Locally Restricted Crossings / 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: Edges and switches, tunnels and bridges / 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: Q4170745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q5661522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Planar Graphs Are Quasiplanar / 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: Testing Full Outer-2-planarity in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / 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: Improving the crossing lemma by finding more crossings in sparse graphs / 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: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum indegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of P. Turan concerning graphs / rank
 
Normal rank

Latest revision as of 15:40, 16 July 2024

scientific article
Language Label Description Also known as
English
Gap-planar graphs
scientific article

    Statements

    Gap-planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 September 2018
    0 references
    beyond planarity \(k\)-gap-planar graphs
    0 references
    density results
    0 references
    complete graphs
    0 references
    recognition problem
    0 references
    \(k\)-planar graphs
    0 references
    \(k\)-quasiplanar graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers