Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Erker, Tjaša Paj"'
A path factor in a graph $G$ is a factor of $G$ in which every component is a path on at least two vertices. Let $T\Box P_n$ be the Cartesian product of a tree $T$ and a path on $n$ vertices. Kao and Weng proved that $T\Box P_n$ is hamiltonian if $T$
Externí odkaz:
http://arxiv.org/abs/2408.06770
Autor:
Erker Tjaša Paj, Špacapan Simon
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 3, Pp 905-920 (2022)
A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G − S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S s
Externí odkaz:
https://doaj.org/article/64ced7580e824859b251c143560162c0
