On the public citation graph

Lattice Structures from Planar Graphs

0 signed · 118 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-oopenalex-snapshot
Exact sampling with coupled Markov chains and applications to statistical mechanics
inferredcites →https://doi.org/10.1007/bf00353652openalex-snapshot
Planar graphs and poset dimension
inferredcites →https://doi.org/10.1007/bf00390104openalex-snapshot
On reorienting graphs by pushing down maximal vertices
inferredcites →https://doi.org/10.1016/s0012-365x(00)00201-6openalex-snapshot
On topological aspects of orientations
inferredcites →https://doi.org/10.1023/a:1010604726900openalex-snapshot
Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes
inferredcites →https://doi.org/10.1023/a:1024483217354openalex-snapshot
A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph
inferredcites →https://doi.org/10.1023/b:orde.0000009251.68514.8bopenalex-snapshot
Geodesic Embeddings and Planar Graphs
inferredcites →https://doi.org/10.1137/0406038openalex-snapshot
The Lattice Structure of Flow in Planar Graphs
inferredcites →https://doi.org/10.18910/3828openalex-snapshot
The duality conjecture in formal knot theory
inferredcites →https://doi.org/10.37236/1330openalex-snapshot
Generating Random Elements of Finite Distributive Lattices
inferredcites →https://doi.org/10.37236/9474openalex-snapshot
Lattice Structure for Orientations of Graphs
inferredcites →https://doi.org/10.4171/dm/117openalex-snapshot
Planar graphs as minimal resolutions of trivariate monomial ideals
inferredcites →https://doi.org/10.5555/320176.320191openalex-snapshot
Embedding planar graphs on the grid

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22005openalex-snapshot
Orienting Triangulations
inferred← citeshttps://doi.org/10.1007/11618058_17openalex-snapshot
Transversal Structures on Triangulations, with Application to Straight-Line Drawing
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_12openalex-snapshot
Rectangle and Square Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_17openalex-snapshot
Equiangular Polygon Contact Representations
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_10openalex-snapshot
Flip Distances Between Graph Orientations
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_9openalex-snapshot
Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph Separators
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_13openalex-snapshot
Plattenbauten: Touching Rectangles in Space
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_90openalex-snapshot
On the Enumeration of Plane Bipolar Posets and Transversal Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_7openalex-snapshot
Aspect Ratio Universal Rectangular Layouts
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_10openalex-snapshot
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_11openalex-snapshot
Straight Line Triangle Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_10openalex-snapshot
Mixing Times of Markov Chains of 2-Orientations
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_32openalex-snapshot
Homothetic Triangle Contact Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_8openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_19openalex-snapshot
On the Number of α-Orientations
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_1openalex-snapshot
Regular Labelings and Geometric Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-18469-7_24openalex-snapshot
Triangle Contact Representations and Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_57openalex-snapshot
Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_53openalex-snapshot
Degree-Constrained Orientations of Embedded Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_13openalex-snapshot
Equilateral L-Contact Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_25openalex-snapshot
Morphing Schnyder Drawings of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_25openalex-snapshot
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00026-024-00729-8openalex-snapshot
Grand-Schnyder Woods
inferred← citeshttps://doi.org/10.1007/s00373-023-02666-4openalex-snapshot
Resonance Graphs on Perfect Matchings of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s00453-006-0114-8openalex-snapshot
Optimal Coding and Sampling of Triangulations
inferred← citeshttps://doi.org/10.1007/s00453-006-0177-6openalex-snapshot
Convex Drawings of 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9514-5openalex-snapshot
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing
inferred← citeshttps://doi.org/10.1007/s00453-016-0256-2openalex-snapshot
A Connection Between Sports and Matroids: How Many Teams Can We Beat?
inferred← citeshttps://doi.org/10.1007/s00453-020-00738-yopenalex-snapshot
Enumerating k-Arc-Connected Orientations
inferred← citeshttps://doi.org/10.1007/s00454-009-9169-zopenalex-snapshot
Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding
inferred← citeshttps://doi.org/10.1007/s00454-012-9400-1openalex-snapshot
Triangle Contact Representations and Duality
inferred← citeshttps://doi.org/10.1007/s00454-013-9552-7openalex-snapshot
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations
inferred← citeshttps://doi.org/10.1007/s00454-016-9832-0openalex-snapshot
Encoding Toroidal Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-016-9850-yopenalex-snapshot
Straight Line Triangle Representations
inferred← citeshttps://doi.org/10.1007/s00454-018-0018-9openalex-snapshot
Morphing Schnyder Drawings of Planar Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-022-00475-9openalex-snapshot
Morphing Triangle Contact Representations of Triangulations
inferred← citeshttps://doi.org/10.1007/s10114-018-7403-4openalex-snapshot
Distance Between α-Orientations of Plane Graphs by Facial Cycle Reversals
inferred← citeshttps://doi.org/10.1007/s10114-019-7403-zopenalex-snapshot
Distance Between α-Orientations of Plane Graphs by Facial Cycle Reversals
inferred← citeshttps://doi.org/10.1007/s10878-014-9786-1openalex-snapshot
Degree-constrained orientations of embedded graphs
inferred← citeshttps://doi.org/10.1007/s11083-007-9075-zopenalex-snapshot
Orthogonal Surfaces and Their CP-Orders
inferred← citeshttps://doi.org/10.1007/s11083-021-09562-7openalex-snapshot
Cluster Algebras and Binary Subwords
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102208openalex-snapshot
Maps of unfixed genus and blossoming trees
inferred← citeshttps://doi.org/10.1016/j.amc.2022.127780openalex-snapshot
Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2013.09.008openalex-snapshot
Decomposition theorem on matchable distributive lattices
inferred← citeshttps://doi.org/10.1016/j.dam.2015.11.016openalex-snapshot
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.093openalex-snapshot
Transversal structures on triangulations: A combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.1016/j.disc.2014.10.020openalex-snapshot
Non-matchable distributive lattices
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114282openalex-snapshot
Structural parameters of Schnyder woods
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.07.011openalex-snapshot
Distributive lattices, polyhedra, and generalized flows
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.031openalex-snapshot
On symmetric quadrangulations and triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.009openalex-snapshot
On the number of planar Eulerian orientations
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.002openalex-snapshot
Cluster algebraic interpretation of infinite friezes
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103290openalex-snapshot
A bijection for essentially 3-connected toroidal maps
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103826openalex-snapshot
Bijections for generalized Tamari intervals via orientations
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103870openalex-snapshot
On the enumeration of plane bipolar posets and transversal structures
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.022openalex-snapshot
Schnyder woods for higher genus triangulated surfaces (abstract)
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.004openalex-snapshot
On symmetric quadrangulations
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.069openalex-snapshot
Pentagon Contact Representations
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.08.006openalex-snapshot
A bijection for triangulations, quadrangulations, pentagulations, etc.
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.06.004openalex-snapshot
Geometric bijections between spanning trees and break divisors
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.01.005openalex-snapshot
Blossoming bijection for higher-genus maps
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.006openalex-snapshot
Sampling Eulerian orientations of triangular lattice graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115551openalex-snapshot
Toward Grünbaum’s conjecture bounding vertices of degree 4
inferred← citeshttps://doi.org/10.1017/s0963548309010001openalex-snapshot
ULD-Lattices and Δ-Bonds
inferred← citeshttps://doi.org/10.1137/1.9781611973105.120openalex-snapshot
Combinatorial and Geometric Properties of Planar Laman Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.164openalex-snapshot
How to Morph Graphs on the Torus
inferred← citeshttps://doi.org/10.1137/110834032openalex-snapshot
Area-Universal and Constrained Rectangular Layouts
inferred← citeshttps://doi.org/10.1137/23m160116xopenalex-snapshot
Plattenbauten: Touching Rectangles in Space
inferred← citeshttps://doi.org/10.1145/1361192.1361196openalex-snapshot
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
inferred← citeshttps://doi.org/10.1145/1377676.1377730openalex-snapshot
Schnyder woods for higher genus triangulated surfaces
inferred← citeshttps://doi.org/10.14279/depositonce-1750openalex-snapshot
Geometric and Combinatorial Structures on Graphs
inferred← citeshttps://doi.org/10.14279/depositonce-3190openalex-snapshot
Geometric Representations of Graphs with Low Polygonal Complexity
inferred← citeshttps://doi.org/10.14279/depositonce-3968openalex-snapshot
Network flows and network design in theory and practice
inferred← citeshttps://doi.org/10.14279/depositonce-5182openalex-snapshot
On the mixing time of the face flip– and up/down Markov chain for some families of graphs
inferred← citeshttps://doi.org/10.1515/9780691185897-010openalex-snapshot
On Balanced Planar Graphs, Following W. Thurston
inferred← citeshttps://doi.org/10.26754/uz.978-84-92774-11-1openalex-snapshot
XIII Encuentros de Geometría Computacional. Zaragoza, 29 de junio al 1 de julio de 2009
inferred← citeshttps://doi.org/10.31274/etd-180810-3299openalex-snapshot
On diamond-free subposets of the Boolean lattice: An application of flag algebras
inferred← citeshttps://doi.org/10.37236/3386openalex-snapshot
A Generic Method for Bijections between Blossoming Trees and Planar Maps
inferred← citeshttps://doi.org/10.37236/7897openalex-snapshot
A Bijection for Essentially 4-Connected Toroidal Triangulations
inferred← citeshttps://doi.org/10.37236/801openalex-snapshot
On the Number of Planar Orientations with Prescribed Degrees
inferred← citeshttps://doi.org/10.37236/833openalex-snapshot
Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings
inferred← citeshttps://doi.org/10.3929/ethz-b-000452875openalex-snapshot
Scaling limit of triangulations of polygons
inferred← citeshttps://doi.org/10.4171/aihpd/82openalex-snapshot
Unified bijections for planar hypermaps with general cycle-length constraints
inferred← citeshttps://doi.org/10.46298/dmtcs.1376openalex-snapshot
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.2869openalex-snapshot
A unified bijective method for maps: application to two classes with boundaries
inferred← citeshttps://doi.org/10.48550/arxiv.0807.1217openalex-snapshot
ULD-Lattices and Delta-Bonds
inferred← citeshttps://doi.org/10.48550/arxiv.0811.1541openalex-snapshot
Distributive Lattices, Polyhedra, and Generalized Flow
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2484openalex-snapshot
Schnyder decompositions for regular plane graphs and application to drawing
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3373openalex-snapshot
CAT-generation of ideals
inferred← citeshttps://doi.org/10.48550/arxiv.1103.3657openalex-snapshot
On symmetric quadrangulations and triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1303.1279openalex-snapshot
Equilateral L-Contact Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4101openalex-snapshot
Trees and co-trees with constant maximum degree in planar 3-connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06970openalex-snapshot
Straight Line Triangle Representations
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00970openalex-snapshot
Flip-distance between α-orientations of graphs embedded on plane and sphere
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07595openalex-snapshot
Morphing Contact Representations of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1912.06855openalex-snapshot
Planar maps and random partitions
inferred← citeshttps://doi.org/10.48550/arxiv.2004.05942openalex-snapshot
Pentagon contact representations
inferred← citeshttps://doi.org/10.48550/arxiv.2011.07481openalex-snapshot
Flips on homologous orientations of surface graphs with prescribed forbidden facial circuits
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14451openalex-snapshot
Dynamic Schnyder Woods
inferred← citeshttps://doi.org/10.48550/arxiv.math/0602163openalex-snapshot
Transversal structures on triangulations: a combinatorial study and straight-line drawings
inferred← citeshttps://doi.org/10.70675/6cfdfdabzdcc8z4393z93ceza47fc3a0185bopenalex-snapshot
Output-sensitive algorithms for enumeration problems in graphs
inferred← citeshttps://doi.org/10.70675/915790c9z1594z4e9czab64zab385caa09d0openalex-snapshot
Planar graphs : non-aligned drawings, power domination and enumeration of Eulerian orientations
inferred← citeshttps://doi.org/10.70675/e2fcdf3dz764ez4e0ez84afzd6f8516baa30openalex-snapshot
Blossoming bijections, multitriangulations : What about other surfaces?
inferred← citeshttps://doi.org/10.7155/jgaa.00219openalex-snapshot
More Canonical Ordering
inferred← citeshttps://doi.org/10.7155/jgaa.00372openalex-snapshot
Straight-Line Triangle Representations via Schnyder Labelings
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.