Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712): 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 topological graphs with at most four crossings per edge / 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: Gap-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some provably hard crossing number problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on rectilinear crossing numbers and plane embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for rectilinear crossing numbers / 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: Crossing numbers of beyond-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs with right angle crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the rectilinear crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Crossings Important for Drawing Large Graphs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological graphs with no large grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Book embeddings and crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing gap \(k\)-planarity is NP-complete / rank
 
Normal rank

Revision as of 11:18, 29 July 2024

scientific article; zbMATH DE number 7549465
Language Label Description Also known as
English
Crossing Numbers of Beyond-Planar Graphs Revisited
scientific article; zbMATH DE number 7549465

    Statements

    Identifiers

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