Robuta

https://arxiv.org/abs/1904.05269 [1904.05269] Planar graphs have bounded nonrepetitive chromatic number Abstract page for arXiv paper 1904.05269: Planar graphs have bounded nonrepetitive chromatic number planar graphs190405269boundedchromatic https://www.dagstuhl.de/seminars/seminar-calendar/seminar-details/24062 Dagstuhl Seminar 24062: Beyond-Planar Graphs: Models, Structures and Geometric Representations dagstuhl seminarplanar graphs24062beyond https://deepai.org/publication/computing-circle-packing-representations-of-planar-graphs Computing Circle Packing Representations of Planar Graphs | DeepAI Nov 1, 2019 - 11/01/19 - The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjo... circle packingplanar graphscomputingrepresentationsdeepai https://arxiv.org/abs/2505.19168 [2505.19168] Effective resistance in planar graphs and continued fractions Abstract page for arXiv paper 2505.19168: Effective resistance in planar graphs and continued fractions planar graphs250519168effectiveresistance https://deepai.org/publication/min-cost-flow-in-unit-capacity-planar-graphs Min-Cost Flow in Unit-Capacity Planar Graphs | DeepAI Jul 4, 2019 - 07/04/19 - In this paper we give an O((nm)^2/3 C) time algorithm for computing min-cost flow (or min-cost circulation) in unit capacity plana... min cost flowunit capacityplanar graphsdeepai https://arxiv.org/abs/1308.2677 [1308.2677] Rotor-routing and spanning trees on planar graphs Abstract page for arXiv paper 1308.2677: Rotor-routing and spanning trees on planar graphs 13082677rotorroutingspanning https://arxiv.org/abs/2205.07968 [2205.07968] $2$-distance, injective, and exact square list-coloring of planar graphs with maximum... Abstract page for arXiv paper 2205.07968: $2$-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 https://arxiv.org/abs/2006.14559 [2006.14559] Ising model and s-embeddings of planar graphs Abstract page for arXiv paper 2006.14559: Ising model and s-embeddings of planar graphs ising model2006embeddingsplanargraphs https://arxiv.org/abs/cs/0309017 [cs/0309017] Enumerating planar locally finite Cayley graphs Abstract page for arXiv paper cs/0309017: Enumerating planar locally finite Cayley graphs locally finitecsplanarcayleygraphs https://www.muni.cz/vyzkum/publikace/1075300 How Not to Characterize Planar-emulable Graphs | Masarykova univerzita | MUNI how not tomasarykova univerzitaplanargraphsmuni https://arxiv.org/abs/2305.02946 [2305.02946] What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? Abstract page for arXiv paper 2305.02946: What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? https://arxiv.org/abs/2209.13776 [2209.13776] On the maximum spread of planar and outerplanar graphs Abstract page for arXiv paper 2209.13776: On the maximum spread of planar and outerplanar graphs on the2209maximum https://deepai.org/publication/on-upward-planar-l-drawings-of-graphs On Upward-Planar L-Drawings of Graphs | DeepAI May 11, 2022 - 05/11/22 - In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge e is represented as a polyline composed of a vertical se... upwardplanardrawingsgraphsdeepai https://arxiv.org/abs/2306.08052 [2306.08052] On coloring parameters of triangle-free planar $(n,m)$-graphs Abstract page for arXiv paper 2306.08052: On coloring parameters of triangle-free planar $(n,m)$-graphs https://arxiv.org/abs/2412.11774v1 [2412.11774v1] Partitions of planar (oriented) graphs into a connected acyclic and an independent... Abstract page for arXiv paper 2412.11774v1: Partitions of planar (oriented) graphs into a connected acyclic and an independent set https://arxiv.org/abs/1208.2223 [1208.2223] Structured Recursive Separator Decompositions for Planar Graphs in Linear Time Abstract page for arXiv paper 1208.2223: Structured Recursive Separator Decompositions for Planar Graphs in Linear Time https://arxiv.org/abs/1506.03361 [1506.03361] The planar Cayley graphs are effectively enumerable I: consistently planar graphs Abstract page for arXiv paper 1506.03361: The planar Cayley graphs are effectively enumerable I: consistently planar graphs cayley graphs150603361planar https://arxiv.org/abs/1206.6142 [1206.6142] Planar Lombardi Drawings for Subcubic Graphs Abstract page for arXiv paper 1206.6142: Planar Lombardi Drawings for Subcubic Graphs 12066142planarlombardidrawings https://arxiv.org/abs/1601.01598 [1601.01598] Strongly Monotone Drawings of Planar Graphs Abstract page for arXiv paper 1601.01598: Strongly Monotone Drawings of Planar Graphs strongly monotone160101598drawingsplanar