On the number of upward planar orientations of maximal planar graphs (Q2250457): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.tcs.2014.04.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084829398 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q54308573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Planar Upward Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward drawings of triconnected digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipolar orientations revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for plane representations of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous embedding of a planar graph and its dual on the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijective counting of plane bipolar orientations / 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: Information Bounds Are Weak in the Shortest Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward Planar Drawing of Single-Source Acyclic Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of planar ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5203027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank

Latest revision as of 18:15, 8 July 2024

scientific article
Language Label Description Also known as
English
On the number of upward planar orientations of maximal planar graphs
scientific article

    Statements

    On the number of upward planar orientations of maximal planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    0 references
    planar graphs
    0 references
    upward planarity
    0 references
    acyclic orientations
    0 references
    counting combinatorial structures
    0 references
    0 references
    0 references