Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte

DOI10.1007/BF01350130zbMath0213.50801OpenAlexW2041801929MaRDI QIDQ2545099

W. Mader

Publication date: 1971

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/162202

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (12)

Unnamed Item ⋮ Subdivisions of maximal 3‐degenerate graphs of order d+1 $d+1$ in graphs of minimum degree d $d$ ⋮ Generalized cut trees for edge-connectivity ⋮ The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices ⋮ Sparse graph certificates for mixed connectivity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing vertex-disjoint paths in large graphs using MAOs ⋮ Cycles of even lengths modulo k ⋮ On k-rails in graphs ⋮ Non-separating trees in connected graphs ⋮ Girth in graphs

Cites Work

• A theorem on n-connected graphs
• Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind

This page was built for publication: Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte