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

(21)

• Even cycles in directed graphs
• Local edge-connectivity in regular bipartite graphs
• 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
• Further results on the rainbow vertex-disconnection of graphs
• Computing vertex-disjoint paths in large graphs using MAOs
• Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
• Extremal connectivity for topological cliques in bipartite graphs
• Coloring Graphs with Constraints on Connectivity
• Computing vertex-disjoint paths in large graphs using MAOs
• A cut tree representation for pendant pairs
• On extremal graphs with exactly one Steiner tree connecting any k vertices
• On mixed connectivity certificates
• Generalized cut trees for edge-connectivity
• Bounds on the largest eigenvalue and energy of the connectivity matrix
• The rainbow vertex-disconnection in graphs
• Sparse connectivity certificates via MA orderings in graphs
• On extremal graphs with at most internally disjoint Steiner trees connecting any n-1 vertices

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)