Planar crossing numbers of graphs of bounded genus (Q452001): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 57M15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6084040 / rank
 
Normal rank
Property / zbMATH Keywords
 
crossing number
Property / zbMATH Keywords: crossing number / rank
 
Normal rank
Property / zbMATH Keywords
 
genus
Property / zbMATH Keywords: genus / rank
 
Normal rank
Property / zbMATH Keywords
 
orientable surface
Property / zbMATH Keywords: orientable surface / rank
 
Normal rank
Property / zbMATH Keywords
 
surface crossing number
Property / zbMATH Keywords: surface crossing number / rank
 
Normal rank
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.1007/s00454-012-9430-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041021602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Exact Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the graph crossing number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the fixed linear crossing number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers and Cutwidths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning planar graphs with vertex costs: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number ofCm �Cn is as conjectured forn ?m(m + 1) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing crossing numbers in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarizing Graphs - A Survey and Annotated Bibliography / 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: Applications of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge separators for graphs of bounded genus with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On VLSI layouts of the star graph and related networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Crossing Numbers of Genus g Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3014503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of P. Turan concerning graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:32, 5 July 2024

scientific article
Language Label Description Also known as
English
Planar crossing numbers of graphs of bounded genus
scientific article

    Statements

    Planar crossing numbers of graphs of bounded genus (English)
    0 references
    0 references
    0 references
    19 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    crossing number
    0 references
    genus
    0 references
    orientable surface
    0 references
    surface crossing number
    0 references
    0 references