Two-Planar Graphs Are Quasiplanar (Q5111262): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Two-Planar Graphs Are Quasiplanar
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv classification
 
cs.CG
Property / arXiv classification: cs.CG / rank
 
Normal rank
Property / arXiv classification
 
cs.DM
Property / arXiv classification: cs.DM / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.05569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On topological graphs with at most four crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal 2- and 3-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing and drawing IC-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph thickness, geometric thickness, and separator theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Edges in $k$-Quasi-planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Crossings Do Matter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Planar Graphs Are Quasiplanar / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on 1-planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor theory / 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: Q5477819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the crossing number / 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: New bounds on the maximum number of edges in \(k\)-quasi-planar graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963074221 / rank
 
Normal rank
Property / title
 
Two-Planar Graphs Are Quasiplanar (English)
Property / title: Two-Planar Graphs Are Quasiplanar (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:25, 30 July 2024

scientific article; zbMATH DE number 7204381
Language Label Description Also known as
English
Two-Planar Graphs Are Quasiplanar
scientific article; zbMATH DE number 7204381

    Statements

    26 May 2020
    0 references
    graph drawing
    0 references
    near-planar graph
    0 references
    simple topological plane graph
    0 references
    cs.CG
    0 references
    cs.DM
    0 references
    math.CO
    0 references
    Two-Planar Graphs Are Quasiplanar (English)
    0 references

    Identifiers