Map graphs having witnesses of large girth (Q2632022): Difference between revisions

@@ Property / cites work @@
+\(\mathsf{NIC}\)-planar graphs
@@ Property / cites work: \(\mathsf{NIC}\)-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing optimal 1-planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Independent Sets in Map Graphs
+Normal rank
@@ Property / cites work @@
+Q4542571
@@ Property / cites work: Q4542571 / rank @@
+Normal rank
@@ Property / cites work @@
+Map graphs
@@ Property / cites work: Map graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing hole-free 4-map graphs in cubic time
@@ Property / cites work: Recognizing hole-free 4-map graphs in cubic time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252289
@@ Property / cites work: Q4252289 / rank @@
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+FO model checking on map graphs
@@ Property / cites work: FO model checking on map graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+On graphs without a \(C_{4}\) or a diamond
@@ Property / cites work: On graphs without a \(C_{4}\) or a diamond / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743499
@@ Property / cites work: Q5743499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5002730
@@ Property / cites work: Q5002730 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
+Normal rank
@@ Property / cites work @@
+Hardness and structural results for half-squares of restricted tree convex bipartite graphs
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of map graphs with outerplanar witness
+Normal rank
@@ Property / cites work @@
+Quick <i>k</i>-Median, <i>k</i>-Center, and Facility Location for Sparse Graphs
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+Finding Even Cycles Even Faster
@@ Property / cites work: Finding Even Cycles Even Faster / rank @@
+Normal rank