Extremal infinite graph theory (Q2275380): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2091084011
@@ Property / OpenAlex ID: W2091084011 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0697
@@ Property / arXiv ID: 1102.0697 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite, highly connected digraphs with no two arc-disjoint spanning trees
+Normal rank
@@ Property / cites work @@
+Q4894622
@@ Property / cites work: Q4894622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+On end degrees and infinite cycles in locally finite graphs
+Normal rank
@@ Property / cites work @@
+Hamilton Cycles in Planar Locally Finite Graphs
@@ Property / cites work: Hamilton Cycles in Planar Locally Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Critically n-Connected Graphs
@@ Property / cites work: Critically n-Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton circles in infinite planar graphs
@@ Property / cites work: Hamilton circles in infinite planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+The Cycle Space of an Infinite Graph
@@ Property / cites work: The Cycle Space of an Infinite Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On infinite cycles. I, II
@@ Property / cites work: On infinite cycles. I, II / rank @@
+Normal rank
@@ Property / cites work @@
+Topological paths, cycles and spanning trees in infinite graphs
+Normal rank
@@ Property / cites work @@
+Q4871749
@@ Property / cites work: Q4871749 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity keeping edges in graphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Infinite Hamilton cycles in squares of locally finite graphs
+Normal rank
@@ Property / cites work @@
+Über die Maximalzahl fremder unendlicher Wege in Graphen
+Normal rank
@@ Property / cites work @@
+Unendliche minimale \(n\)-fach zusammenhängende Graphen
+Normal rank
@@ Property / cites work @@
+On critically h-connected simple graphs
@@ Property / cites work: On critically h-connected simple graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A weaker version of Lovász' path removal conjecture
+Normal rank
@@ Property / cites work @@
+Mader's conjecture on extremely critical graphs
@@ Property / cites work: Mader's conjecture on extremely critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimally n-line connected graphs.
@@ Property / cites work: Minimally n-line connected graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Eine Eigenschaft der Atome endlicher Graphen
@@ Property / cites work: Eine Eigenschaft der Atome endlicher Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Minimale \(n\)-fach kantenzusammenhängende Graphen
+Normal rank
@@ Property / cites work @@
+Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
+Normal rank
@@ Property / cites work @@
+Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
+Normal rank
@@ Property / cites work @@
+Über den Zusammenhang symmetrischer Graphen
@@ Property / cites work: Über den Zusammenhang symmetrischer Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs, reducing the edge-connectivity only by two
+Normal rank
@@ Property / cites work @@
+Endlichkeitssätze für k-kritische Graphen
@@ Property / cites work: Endlichkeitssätze für k-kritische Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-con-critically \(n\)-connected graphs
@@ Property / cites work: On \(k\)-con-critically \(n\)-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Vertices of Degree <i>n</i> in Minimally <i>n</i>-Edge-Connected Graphs
+Normal rank
@@ Property / cites work @@
+Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)
+Normal rank
@@ Property / cites work @@
+Kreuzungsfreie a,b-Wege in endlichen Graphen
@@ Property / cites work: Kreuzungsfreie a,b-Wege in endlichen Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian lines in infinite graphs with few vertices of smll valency
+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 @@
+Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
+Normal rank
@@ Property / cites work @@
+On a packing problem for infinite graphs and independence spaces
+Normal rank
@@ Property / cites work @@
+Forcing highly connected subgraphs
@@ Property / cites work: Forcing highly connected subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ends and Vertices of Small Degree in Infinite Minimally <i>k</i>-(Edge)-Connected Graphs
+Normal rank
@@ Property / cites work @@
+Arboricity and tree-packing in locally finite graphs
+Normal rank
@@ Property / cites work @@
+Forcing Large Complete (Topological) Minors in Infinite Graphs
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decomposition with applications to subdivisions and path systems modulo <i>k</i>
+Normal rank
@@ Property / cites work @@
+Nonseparating cycles inK-Connected graphs
@@ Property / cites work: Nonseparating cycles inK-Connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Infinite paths in planar graphs V, 3‐indivisible graphs
+Normal rank