Grad und lokaler Zusammenhang in endlichen Graphen

DOI10.1007/BF01432512MaRDI QIDQ2555085zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(20)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555085)