A characterization of complete bipartite RAC graphs (Q765516): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59702321, #quickstatements; #temporary_batch_1712261475387 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Perspectives Opened by 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: Drawing Graphs with Right Angle Crossings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5786239 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The crossing number of K5,n / rank | |||
Normal rank | |||
Latest revision as of 00:54, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of complete bipartite RAC graphs |
scientific article |
Statements
A characterization of complete bipartite RAC graphs (English)
0 references
19 March 2012
0 references
computational geometry
0 references
combinatorial problems
0 references
graph algorithms
0 references
theory of computation
0 references
