Výsledky vyhledávání - "Veldman, H.J."

Let $k$, $d$ and $\lambda$ be positive integers. A cycle $C$ of $G$ is called a $D_{\lambda}$-cycle if every component of $G-V(C)$ has order less than $\lambda$. It is shown that if $G$ is a $k$-connected $d$-regular graph (\,$k\geq 2$\,) on $n\leq (

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::bda1e438fdc3a76f847bef3fd5ca0c7d
https://research.utwente.nl/en/publications/long-dcycles-in-regular-graphs(9ea97ff7-7b20-4b1b-a384-a8ac217349da).html

Zobrazit plný text záznamu

Chordality and 2-factors in tough graphs

Autor: Bauer, D., Katona, G.Y., Kratsch, D., Veldman, H.J.

A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved that all ..-tough 5-chordal graphs have a 2-factor. This result is best

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::b7412578fc189b0caeddd32740e8870b
https://research.utwente.nl/en/publications/4d5275e8-12fb-4d7e-bbae-a164a3f23c51

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání