Up-embeddability of a graph by order and girth (Q2464047): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-007-0746-8
@@ Property / DOI: 10.1007/s00373-007-0746-8 / rank @@
-Normal rank
@@ 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/s00373-007-0746-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2083039657
@@ Property / OpenAlex ID: W2083039657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3837101
@@ Property / cites work: Q3837101 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4237048
@@ Property / cites work: Q4237048 / rank @@
+Normal rank
@@ Property / cites work @@
+A class of upper-embeddable graphs
@@ Property / cites work: A class of upper-embeddable graphs / 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 @@
+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 @@
+Every connected, locally connected graph is upper embeddable
+Normal rank
@@ Property / cites work @@
+On locally quasiconnected graphs and their upper embeddability
+Normal rank
@@ Property / cites work @@
+A new characterization of the maximum genus of a graph
+Normal rank
@@ Property / cites work @@
+On the maximum genus of a graph
@@ Property / cites work: On the maximum genus of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Kuratowski-type theorem for the maximum genus of a graph
+Normal rank
@@ Property / cites work @@
+Q3344220
@@ Property / cites work: Q3344220 / 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 / DOI @@
+.1007/S00373-007-0746-8
@@ Property / DOI: 10.1007/S00373-007-0746-8 / rank @@
+Normal rank