On the Decay of Crossing Numbers of Sparse Graphs (Q3466340): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1493760462 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114236170 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1203.0510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement on the decay of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large non-planar graphs and an application to crossing-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with restricted degrees of their vertices in planar 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-degree restricted paths in polyhedral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decay of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On light cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On light graphs in 3-connected plane graphs without triangular or quadrangular faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly light cycles in embedded graphs and crossing-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light paths in 4-connected graphs in the plane and other surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected Crossing Numbers / 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: Which crossing number is it anyway? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal graphs with crossing number at least \(k\) / 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: Crossing numbers of random graphs / rank
 
Normal rank

Latest revision as of 09:24, 11 July 2024

scientific article
Language Label Description Also known as
English
On the Decay of Crossing Numbers of Sparse Graphs
scientific article

    Statements

    On the Decay of Crossing Numbers of Sparse Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2016
    0 references
    crossing numbers
    0 references
    decay of crossing numbers
    0 references
    light subgraphs
    0 references
    expected crossing numbers
    0 references

    Identifiers