Notes in lecture4 - connectedness

To Subscribe, use this Key

Status	Last Update	Fields
Published	09/30/2023	\(k\)-connected graph
Published	09/30/2023	vertex connectivity \(κ(G)\) of a graph
Published	09/30/2023	connected \(\sim k\)-connected ?
Published	09/30/2023	what is the vertex connectivity of the complete graph
Published	09/30/2023	What can be said about the vertex connectivity of trees
Published	09/30/2023	independent paths
Published	09/30/2023	characterization of k-connected with independent paths
Published	09/30/2023	A-B-path
Published	09/30/2023	X separates A and B in G
Published	09/30/2023	X separates G
Published	09/30/2023	disjoint paths
Published	09/30/2023	Mengers Theorem
Published	09/30/2023	Mengers theorem applied to single vertices
Published	09/30/2023	characterisation of k-connected (independent paths)
Published	09/30/2023	For a graph G with {{c1::\(\|V\| > 1\)}} TFAE:1) {{c1::G is 2-connected}}2) {{c2::Any two vertives in G lie on a common cycle of G}}
Published	09/30/2023	H-path
Published	09/30/2023	A way to construct a 2-connected graph
Published	09/30/2023	l-edge connected
Published	09/30/2023	edge-connectivity \(λ(G)\)
Published	09/30/2023	If G {{c2::disconnected}} - {{c1::\(λ(G) = 0\)}}If G {{c2::connected}} - {{c1::todo}}\(λ({{c2::K_n}}) = {{c1::n-1}}\)
Published	09/30/2023	ordering l-edge connectivity, vertex connectivity, and the minimal amount of neighbours
Published	10/02/2023	edge connectivity Menger Theorem
Published	10/02/2023	Eulerian walk
Status	Last Update	Fields