Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Fan's condition"'
Autor:
Wojciech Wideł
Publikováno v:
Opuscula Mathematica, Vol 37, Iss 4, Pp 617-639 (2017)
Let \(\mathcal{H}\) be a family of simple graphs and \(k\) be a positive integer. We say that a graph \(G\) of order \(n\geq k\) satisfies Fan's condition with respect to \(\mathcal{H}\) with constant \(k\), if for every induced subgraph \(H\) of \(G
Externí odkaz:
https://doaj.org/article/927939dc7c904a3e810e6ea211feebc2
Autor:
Wideł, Wojciech1 widel@agh.edu.pl
Publikováno v:
Opuscula Mathematica. 2017, Vol. 37 Issue 4, p617-639. 23p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Zhiquan Hu
Publikováno v:
Discrete Mathematics. 196:167-175
Let G be a 2-connected graph with n vertices and H be an induced subgraph of G. Denote V0 ≔ {v ϵ V(G): d(v) ⩾ n/2}. If there exists a pair of vertices x and y at distance 2 in H such that {x, y} ⊆ V(H)βV0, then H is called degree light. Let F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbcc9ebef529963040858da9075e08f7
https://doi.org/10.1016/s0012-365x(98)00200-3
https://doi.org/10.1016/s0012-365x(98)00200-3
Publikováno v:
Discrete Mathematics. 115(1-3):39-50
A weakened version of Fan's condition for Hamiltonicity is shown to be sufficient for a 2-connected graph to be pancyclic (with a few exceptions). Also, a similar condition is shown to be sufficient for a 3-connected graph to be Hamiltonian-connected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::799eab004ed6ef150698d3269fad133b
Autor:
Pak-Ken Wong
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 24, Iss 10, Pp 691-697 (2000)
Let G be a connected graph of order n and X={x∈V:d(x)≥n/2}. Suppose |X|≥3 and G satisfies the modified Fan's condition. We show that the vertices of the block B of G containing X form a cycle. This generalizes a result of Fan. We also give an e
Externí odkaz:
https://doaj.org/article/8a8802d69f764cc0807c77d84a73d56d
Publikováno v:
Journal of Graph Theory. Oct2023, Vol. 104 Issue 2, p341-359. 19p.
Publikováno v:
Proceedings of the American Mathematical Society; Jul2014, Vol. 142 Issue 7, p2303-2311, 9p
Publikováno v:
Daily Mail. 1/10/2018, p19. 1p.