Grad und lokaler Zusammenhang in endlichen Graphen

DOI10.1007/BF01432512zbMath0245.05119OpenAlexW1986807567MaRDI QIDQ2555085

W. Mader

Publication date: 1973

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (20)

Even cycles in directed graphs ⋮ The rainbow vertex-disconnection in graphs ⋮ Sparse connectivity certificates via MA orderings in graphs ⋮ Local edge-connectivity in regular bipartite graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Generalized cut trees for edge-connectivity ⋮ On \(n\)-skein isomorphisms of graphs ⋮ An application of connectivity theory in graphs to factorizations of elements in groups ⋮ On mixed connectivity certificates ⋮ Partitioning sparse graphs into an independent set and a forest of bounded degree ⋮ A Brooks type theorem for the maximum local edge connectivity ⋮ Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On extremal graphs with exactly one Steiner tree connecting any $k$ vertices ⋮ Computing vertex-disjoint paths in large graphs using MAOs ⋮ Further results on the rainbow vertex-disconnection of graphs ⋮ Coloring Graphs with Constraints on Connectivity ⋮ On mixed connectivity certificates ⋮ Extremal connectivity for topological cliques in bipartite graphs

This page was built for publication: Grad und lokaler Zusammenhang in endlichen Graphen