Bounded Embeddings of Graphs in the Plane (Q2819488): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2534301164 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1610.07144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Windrose Planarity: Embedding Graphs with Direction-Constrained Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward drawings of triconnected digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous planar graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for generalized thrackles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Weakly Simple Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-Planarity of C-Connected Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Cycles into Cycles of Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding a cycle in a plane graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental convex planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the Hanani-Tutte Theorem for Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(c\)-planarity of embedded cyclic \(c\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hanani–Tutte, Monotone Drawings, and Level-Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Upward and Rectilinear Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical planarity testing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating Tverberg Points, I. An Analogue of the Whitney Trick / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an implementation of the 3D visibility skeleton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 14:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Bounded Embeddings of Graphs in the Plane
scientific article

    Statements

    Bounded Embeddings of Graphs in the Plane (English)
    0 references
    0 references
    29 September 2016
    0 references
    graph planarity testing
    0 references
    weakly simple embedding
    0 references
    c-planarity
    0 references
    PQ-tree
    0 references
    algebraic crossing number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references