Gap-Planar Graphs (Q4625141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Matias Korman / rank
Normal rank
 
Property / author
 
Property / author: Csaba D. Tóth / rank
Normal rank
 
Property / author
 
Property / author: Matias Korman / rank
 
Normal rank
Property / author
 
Property / author: Csaba D. Tóth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022373642 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.07653 / rank
 
Normal rank
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: 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: 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: Algorithms for graphs embeddable with few crossings per edge / 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 density of fan-planar graphs / 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 09:03, 18 July 2024

scientific article; zbMATH DE number 7027013
Language Label Description Also known as
English
Gap-Planar Graphs
scientific article; zbMATH DE number 7027013

    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
    20 February 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references