Bounds on the crossing resolution of complete geometric graphs (Q765347): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037942952 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62042447 / 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: Graphs that Admit Right Angle Crossing Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree graphs have arbitrarily large geometric thickness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs with Right Angle Crossings / 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: Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Thickness of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing cubic graphs with at most five slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric representation of cubic graphs with four directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree graphs can have arbitrarily large slope numbers / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the crossing resolution of complete geometric graphs
scientific article

    Statements

    Identifiers