Forbidden subgraphs and the existence of a spanning tree without small degree stems (Q390302): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2013.05.020
+Normal rank
@@ Property / OpenAlex ID @@
+W2036601215
@@ Property / OpenAlex ID: W2036601215 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with homeomorphically irreducible spanning trees
+Normal rank
@@ Property / cites work @@
+Graph classes characterized both by forbidden subgraphs and degree sequences
+Normal rank
@@ Property / cites work @@
+Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+A pair of forbidden subgraphs and perfect matchings.
+Normal rank
@@ Property / cites work @@
+Forbidden triples and traceability: A characterization
+Normal rank
@@ Property / cites work @@
+Forbidden induced subgraphs for perfect matchings
@@ Property / cites work: Forbidden induced subgraphs for perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2828975
@@ Property / cites work: Q2828975 / rank @@
+Normal rank