Grad und lokaler Zusammenhang in endlichen Graphen
From MaRDI portal
Publication:2555085
DOI10.1007/BF01432512zbMATH Open0245.05119OpenAlexW1986807567MaRDI QIDQ2555085FDOQ2555085
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
Cited In (20)
- The rainbow vertex-disconnection in graphs
- Title not available (Why is that?)
- Extremal connectivity for topological cliques in bipartite graphs
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices
- On extremal graphs with exactly one Steiner tree connecting any \(k\) vertices
- An application of connectivity theory in graphs to factorizations of elements in groups
- A Brooks type theorem for the maximum local edge connectivity
- Sparse connectivity certificates via MA orderings in graphs
- Even cycles in directed graphs
- Further results on the rainbow vertex-disconnection of graphs
- Coloring Graphs with Constraints on Connectivity
- On mixed connectivity certificates
- Generalized cut trees for edge-connectivity
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
- Computing vertex-disjoint paths in large graphs using MAOs
- Title not available (Why is that?)
- On mixed connectivity certificates
- On \(n\)-skein isomorphisms of graphs
- Partitioning sparse graphs into an independent set and a forest of bounded degree
- Local edge-connectivity in regular bipartite graphs
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)
