Zobrazeno 1 - 1
of 1
pro vyhledávání: '"R. J. Kingan"'
Autor:
R. J. Kingan, S. R. Kingan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Pp 1-7 (2024)
AbstractA 3-connected cubic graph is cyclically 4-connected if it has at least [Formula: see text] vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles. By introducing the notion of cycle sp
Externí odkaz:
https://doaj.org/article/95a9566ec4314705ac0b76e128fa5276
