Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756): 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.7155/jgaa.00463
+Normal rank
@@ Property / OpenAlex ID @@
+W3098926989
@@ Property / OpenAlex ID: W3098926989 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of edges in quasi-planar graphs
+Normal rank
@@ Property / cites work @@
+Quasi-planar graphs have a linear number of edges
@@ Property / cites work: Quasi-planar graphs have a linear number of edges / 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 @@
+Colorings and orientations of graphs
@@ Property / cites work: Colorings and orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorics and Geometry of Finite and Infinite Squaregraphs
+Normal rank
@@ Property / cites work @@
+Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
+Normal rank
@@ Property / cites work @@
+On the Density of Maximal 1-Planar Graphs
@@ Property / cites work: On the Density of Maximal 1-Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangular layouts and contact graphs
@@ Property / cites work: Rectangular layouts and contact graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of minimum distance graphs
+Normal rank
@@ Property / cites work @@
+On Triangle Contact Graphs
@@ Property / cites work: On Triangle Contact Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633932
@@ Property / cites work: Q4633932 / rank @@
+Normal rank
@@ Property / cites work @@
+-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
+Normal rank
@@ Property / cites work @@
+The logic engine and the realization problem for nearest neighbor graphs
+Normal rank
@@ Property / cites work @@
+Densities of minor-closed graph families
@@ Property / cites work: Densities of minor-closed graph families / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Angular Resolution for Face-Symmetric Drawings
+Normal rank
@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820391
@@ Property / cites work: Q4820391 / rank @@
+Normal rank
@@ Property / cites work @@
+Contact graphs of line segments are NP-complete
@@ Property / cites work: Contact graphs of line segments are NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Representing graphs by disks and balls (a survey of recognition-complexity results)
+Normal rank
@@ Property / cites work @@
+Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
+Normal rank
@@ Property / cites work @@
+Q4328195
@@ Property / cites work: Q4328195 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339095
@@ Property / cites work: Q4339095 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228512
@@ Property / cites work: Q4228512 / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
+Normal rank
@@ Property / cites work @@
+Q5881910
@@ Property / cites work: Q5881910 / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A short list color proof of Grötzsch's theorem
@@ Property / cites work: A short list color proof of Grötzsch's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A not 3-choosable planar graph without 3-cycles
@@ Property / cites work: A not 3-choosable planar graph without 3-cycles / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q130064870
@@ Property / Wikidata QID: Q130064870 / rank @@
+Normal rank