Kreuzungsfreie a,b-Wege in endlichen Graphen
From MaRDI portal
Publication:2562094
DOI10.1007/BF02993546zbMath0266.05111MaRDI QIDQ2562094
Publication date: 1974
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
05C35: Extremal problems in graph theory
Related Items
On removable circuits in graphs and matroids, Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen, A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors, Sparse connectivity certificates via MA orderings in graphs, A weaker version of Lovász' path removal conjecture, Note on non-separating and removable cycles in highly connected graphs, Removing circuits in 3-connected binary matroids, Non-separating induced cycles in graphs, Removable circuits in multigraphs, Decomposition of the product of cycles based on degree partition, Contractible bonds in graphs, On removable even circuits in graphs, Removable cycles avoiding two connected subgraphs, Extremal infinite graph theory, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, Kantendisjunkte Wege in Graphen
Cites Work