Graphs with supereulerian width 3 and small diameters (Q6672023): Difference between revisions

@@ Property / cites work @@
+The spanning subgraphs of eulerian graphs
@@ Property / cites work: The spanning subgraphs of eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs: A survey
@@ Property / cites work: Supereulerian graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without spanning closed trails
@@ Property / cites work: Graphs without spanning closed trails / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity and edge-disjoint spanning trees
+Normal rank
@@ Property / cites work @@
+Super-Eulerian graphs and the Petersen graph. II
@@ Property / cites work: Super-Eulerian graphs and the Petersen graph. II / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity and edge-disjoint spanning trees
@@ Property / cites work: Connectivity and edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Sub-Eulerian Graphs
@@ Property / cites work: A Note on Sub-Eulerian Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reduced graphs of diameter two
@@ Property / cites work: Reduced graphs of diameter two / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian connectedness in 3-connected line graphs
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on graphs spanned by Eulerian graphs
@@ Property / cites work: A note on graphs spanned by Eulerian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Polynomially determine if a graph is \((s,3)\)-supereulerian
+Normal rank