Partition conditions and vertex-connectivity of graphs

DOI10.1007/BF02579332zbMATH Open0494.05041OpenAlexW2134700222MaRDI QIDQ1168985FDOQ1168985

Authors: Ervin Győri 

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)

Cites Work

• Title not available (Why is that?)
• A homology theory for spanning tress of a graph
• Extensions of Menger's Theorem^†
• Title not available (Why is that?)
• An Example of a Continuous Junction for a Singular Control Problem of Even Order
• Connectedness and classification of certain graphs

Cited In (2)

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

This page was built for publication: Partition conditions and vertex-connectivity of graphs

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