Planar lattices and planar graphs
From MaRDI portal
Publication:1227629
DOI10.1016/0095-8956(76)90024-1zbMath0332.05103OpenAlexW1985156927WikidataQ61772234 ScholiaQ61772234MaRDI QIDQ1227629
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(76)90024-1
Planar graphs; geometric and topological aspects of graph theory (05C10) Structure theory of lattices (06B05)
Related Items
Fundamentals of planar ordered sets, A left-first search algorithm for planar graphs, Upward planarity testing, Planar groups, Algorithms for plane representations of acyclic digraphs, Unnamed Item, Combinatorics of triangular partitions, \(st\)-orientations with few transitive edges, $st$-Orientations with Few Transitive Edges, An SPQR-tree-like embedding representation for upward planarity, Bipartite graphs, upward drawings, and planarity, Dimension and automorphism groups of lattices, Planarity and fixing number of inclusion graph of a nilpotent group, Area requirement and symmetry display of planar upward drawings, Maximum upward planar subgraphs of embedded planar digraphs, Light sources, obstructions and spherical orders, Planar lattices are lexicographically shellable, Upward drawings of triconnected digraphs., Finite groups with planar subgroup lattices., The Number of Plane Diagrams of a Lattice, Path length in the covering graph of a lattice, Upward planar graphs and their duals, Confluent Hasse Diagrams, Unnamed Item, Crooked diagrams with few slopes, Planar acyclic oriented graphs, Two-dimensional partial orderings: Undecidability, Bipolar orientations revisited, Every triangle-free planar graph has a planar upward drawing, Line directionality of orders
Cites Work
