On RAC drawings of graphs with one bend per edge (Q5915940): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3021869058 / rank
 
Normal rank
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 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: 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 RAC drawings of graphs with one bend per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Perspectives Opened by Right Angle Crossing Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Straight-Line RAC Drawing Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs that admit right angle crossing drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathsf{NIC}\)-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap-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: On Optimal 2- and 3-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact drawings of 1-planar graphs with right-angle crossings and few bends / 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: 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: A characterization of complete bipartite RAC 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: Right angle crossing graphs and 1-planarity / 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: 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: 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: Empirical evaluation of aesthetics-based graph layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank

Latest revision as of 06:13, 18 July 2024

scientific article; zbMATH DE number 7023820
Language Label Description Also known as
English
On RAC drawings of graphs with one bend per edge
scientific article; zbMATH DE number 7023820

    Statements

    On RAC drawings of graphs with one bend per edge (English)
    0 references
    15 February 2019
    0 references
    0 references

    Identifiers