Results 311 to 318 of about 976,099 (318)

On certain n-connected matroids.

Journal für die reine und angewandte Mathematik (Crelles Journal), 1978
openaire   +2 more sources

A Note on k-Critically n-Connected Graphs

Proceedings of the American Mathematical Society, 1977
Entringer, R. C., Slater, Peter J.
openaire   +1 more source

ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS

JP Journal of Algebra, Number Theory and Applications, 2017
Mohommed, Eman F., Ibrahim, Haslinda, Ahmad, Nazihah   +2 more
openaire   +2 more sources

Squeezing functions of n-connected domains

The explicit formula of the squeezing function for the annulus firstly was given by Ng, Tang and Tsai (2021). In the paper of them, they used Loewner differential equations to prove the explicit formula. Later, Gumenyuk and Roth (2021) gave an alternative proof via potential theoretical tools.
openaire   +1 more source

DOMINATING CYCLE OF n-CONNECTED GRAPH

Advances and Applications in Discrete Mathematics, 2017
openaire   +1 more source

transportation system [n], connection to a

2010
openaire   +1 more source

Critically and minimally n-connected graphs

1969
openaire   +1 more source

Algebraic dimensions and Galois cohomology of SO(N)-connections

openaire   +1 more source