Partition conditions and vertex-connectivity of graphs

DOI10.1007/BF02579332zbMath0494.05041OpenAlexW2134700222MaRDI QIDQ1168985

Ervin Gyoeri

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579332

zbMATH Keywords

connected subgraphconnectivity numberpartition of the vertex-set

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, Mondshein Sequences (a.k.a. (2,1)-Orders)

Cites Work

• Unnamed Item
• Unnamed Item
• Connectedness and classification of certain graphs
• A homology theory for spanning tress of a graph
• An Example of a Continuous Junction for a Singular Control Problem of Even Order
• Extensions of Menger's Theorem^†