On the Size of Planarly Connected Crossing Graphs (Q2961524): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: On grids in topological graphs / 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: Research Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Turán-type theorem on chords of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477819 / 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: Removing even crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the maximum number of edges in \(k\)-quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank

Latest revision as of 10:40, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Size of Planarly Connected Crossing Graphs
scientific article

    Statements

    On the Size of Planarly Connected Crossing Graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2017
    0 references
    planar graphs
    0 references
    crossing edges
    0 references
    crossing-free edge
    0 references
    fan-planar graphs
    0 references
    1-planar graphs
    0 references

    Identifiers