Kreuzungsfreie a,b-Wege in endlichen Graphen

DOI10.1007/BF02993546zbMath0266.05111MaRDI QIDQ2562094

W. Mader

Publication date: 1974

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (16)

Decomposition of the product of cycles based on degree partition ⋮ On removable even circuits in graphs ⋮ Sparse connectivity certificates via MA orderings in graphs ⋮ Removable circuits in multigraphs ⋮ Non-separating induced cycles in graphs ⋮ Removable cycles avoiding two connected subgraphs ⋮ A weaker version of Lovász' path removal conjecture ⋮ Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs ⋮ Contractible bonds in graphs ⋮ Extremal infinite graph theory ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ On removable circuits in graphs and matroids ⋮ Note on non-separating and removable cycles in highly connected graphs ⋮ Removing circuits in 3-connected binary matroids ⋮ Kantendisjunkte Wege in Graphen ⋮ Über die Anzahl der 1-Faktoren in 2-fach zusammenhängenden Graphen

Cites Work

• Kantendisjunkte Wege in Graphen
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Unnamed Item
• Unnamed Item

This page was built for publication: Kreuzungsfreie a,b-Wege in endlichen Graphen