Robust Connectivity of Graphs on Surfaces (Q5084099): Difference between revisions

@@ Property / cites work @@
+Graphs with homeomorphically irreducible spanning trees
+Normal rank
@@ Property / cites work @@
+Max-leaves spanning tree is APX-hard for cubic graphs
+Normal rank
@@ Property / cites work @@
+A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
+Normal rank
@@ Property / cites work @@
+Q4137202
@@ Property / cites work: Q4137202 / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Flexible List Colorings in Graphs with Special Degeneracy Conditions
+Normal rank
@@ Property / cites work @@
+Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
+Normal rank
@@ Property / cites work @@
+Edge‐maximal graphs on orientable and some nonorientable surfaces
+Normal rank
@@ Property / cites work @@
+Large induced forests in planar graphs with girth 4
+Normal rank
@@ Property / cites work @@
+A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
+Normal rank
@@ Property / cites work @@
+Connected dominating set. Theory and applications
@@ Property / cites work: Connected dominating set. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity ecology of parameters: An illustration using bounded max leaf number
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+Minimum feedback vertex set and acyclic coloring.
@@ Property / cites work: Minimum feedback vertex set and acyclic coloring. / rank @@
+Normal rank
@@ Property / cites work @@
+Solving connected dominating set faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum and minimum toughness of graphs of small genus
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves in cubic graphs
@@ Property / cites work: Spanning trees with many leaves in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees in graphs of minimum degree 4 or 5
@@ Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4819371
@@ Property / cites work: Q4819371 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971782
@@ Property / cites work: Q3971782 / rank @@
+Normal rank
@@ Property / cites work @@
+The genus of complete 3-uniform hypergraphs
@@ Property / cites work: The genus of complete 3-uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4081276
@@ Property / cites work: Q4081276 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum size of feedback vertex sets of planar graphs of girth at least five
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Below All Subsets for Minimal Connected Dominating Set
+Normal rank
@@ Property / cites work @@
+Robust Randomized Matchings
@@ Property / cites work: Robust Randomized Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Maximal Graphs on Surfaces
@@ Property / cites work: Edge-Maximal Graphs on Surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Large induced forests in triangle-free planar graphs
+Normal rank
@@ Property / cites work @@
+Large Induced Forests in Graphs
@@ Property / cites work: Large Induced Forests in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for cubic graphs / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4283011735
@@ Property / OpenAlex ID: W4283011735 / rank @@
+Normal rank