A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs (Q1864218): Difference between revisions

@@ Property / cites work @@
+Bounds of the number of disjoint spanning trees
@@ Property / cites work: Bounds of the number of disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4716822
@@ Property / cites work: Q4716822 / rank @@
+Normal rank
@@ Property / cites work @@
+How to determine the maximum genus of a graph
@@ Property / cites work: How to determine the maximum genus of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Characterization in of Upper-Embeddable Graphs
@@ Property / cites work: A Characterization in of Upper-Embeddable Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds For Induced Forests in Cubic Graphs
@@ Property / cites work: Lower Bounds For Induced Forests in Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216652
@@ Property / cites work: Q3216652 / rank @@
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the maximum genus of a simplicial graph
+Normal rank
@@ Property / cites work @@
+Upper embeddability and connectivity of graphs
@@ Property / cites work: Upper embeddability and connectivity of graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02684036
+Normal rank
@@ Property / OpenAlex ID @@
+W2033518193
@@ Property / OpenAlex ID: W2033518193 / rank @@
+Normal rank