Contact Graphs of Circular Arcs (Q3449800): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21840-3_1
+Normal rank
@@ Property / OpenAlex ID @@
+W1642013906
@@ Property / OpenAlex ID: W1642013906 / rank @@
+Normal rank
@@ Property / cites work @@
+Proportional Contact Representations of Planar Graphs
+Normal rank
@@ Property / cites work @@
+Balanced Circle Packings for Planar Graphs
@@ Property / cites work: Balanced Circle Packings for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Contact Graphs of Circular Arcs
@@ Property / cites work: Contact Graphs of Circular Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+A bijection for triangulations, quadrangulations, pentagulations, etc.
+Normal rank
@@ Property / cites work @@
+Triangle-Free Planar Graphs and Segment Intersection Graphs
+Normal rank
@@ Property / cites work @@
+On topological aspects of orientations
@@ Property / cites work: On topological aspects of orientations / rank @@
+Normal rank
@@ Property / cites work @@
+Barycentric systems and stretchability
@@ Property / cites work: Barycentric systems and stretchability / rank @@
+Normal rank
@@ Property / cites work @@
+Representations by contact and intersection of segments
+Normal rank
@@ Property / cites work @@
+Optimal polygonal representation of planar graphs
@@ Property / cites work: Optimal polygonal representation of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Area-Universal and Constrained Rectangular Layouts
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle contact representations and duality
@@ Property / cites work: Triangle contact representations and duality / rank @@
+Normal rank
@@ Property / cites work @@
+Planar minimally rigid graphs and pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Classes and recognition of curve contact graphs
@@ Property / cites work: Classes and recognition of curve contact graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Pebble game algorithms and sparse graphs
@@ Property / cites work: Pebble game algorithms and sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Inductive Construction of (2,1)-tight Graphs
@@ Property / cites work: An Inductive Construction of (2,1)-tight Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing Graphs with Few Arcs
@@ Property / cites work: Drawing Graphs with Few Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717849
@@ Property / cites work: Q4717849 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3449800