On k-Connected Gamma-Extensions of Binary Matroids
classification
🧮 math.CO
keywords
operationbinarygammaconnectedextensionmatroidgraphsmatroids
read the original abstract
Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $\Gamma$-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and sufficient conditions to preserve $k$-connectedness of a binary matroid under the $\Gamma$-extension operation. We also obtain a necessary and sufficient condition to get a connected matroid from a disconnected binary matroid using the $\Gamma$-extension operation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.