A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3840854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing numbers of products of cycles and graphs of order four / 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: Q5543311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for planar \(k\)-sets and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of sums and products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and sumsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on polynomials and rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations of crossings in graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing numbers of some generalized Petersen graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set of Differences of a Given Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5587734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4748171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the rectilinear crossing number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing numbers of products of paths and stars with 4‐vertex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing numbers of Cartesian products of paths with 5-vertex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number ofC5 �Cn / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4701026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the thickness of graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing numbers of certain generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Incidences Between Points and Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on crossing numbers / 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: Q4484691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of \(C_3\times C_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of a graph on a compact 2-manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawings of graphs on surfaces with few crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of P. Turan concerning graphs / rank
 
Normal rank

Revision as of 14:02, 6 June 2024

scientific article
Language Label Description Also known as
English
A successful concept for measuring non-planarity of graphs: The crossing number.
scientific article

    Statements

    A successful concept for measuring non-planarity of graphs: The crossing number. (English)
    0 references
    14 February 2004
    0 references
    This survey paper reviews foundational, historical, and philosophical issues concerning crossing numbers, while arguing for the significance of this graph-theoretical parameter. It also establishes a new lower bound for crossing numbers, potentially useful in their estimation.
    0 references
    Graph drawing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers