Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Carol T. Zamfirescu"'
Autor:
Jan Goedgebeur, Carol T. Zamfirescu
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 4, Iss Graph Theory (2019)
A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J. Graph Theory 7
Externí odkaz:
https://doaj.org/article/0a4dc3bd1d74469fa76402c51ec8aed6
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 1, Iss 1, Pp 56-76 (2013)
This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs emb
Externí odkaz:
https://doaj.org/article/79df9b859b4144f78e66f49ce8de20da
Autor:
Zdeněk Ryjáček, Carol T. Zamfirescu
Publikováno v:
Opuscula Mathematica, Vol 30, Iss 4, Pp 527-532 (2010)
A collection of open problems that were posed at the 18th Workshop ‘3in1’, held on November 26-28, 2009 in Krakow, Poland. The problems are presented by Zdenek Ryjacek in “Does the Thomassen's conjecture imply N=NP?” and “Dominating cycles
Externí odkaz:
https://doaj.org/article/f33fd2ff80b14d8ca0e9d52623bf7088
Publikováno v:
JOURNAL OF GRAPH THEORY
In 1978 Thomassen asked whether planar hypohamiltonian oriented graphs exist. Infinite families of such graphs have since been described but for infinitely many n it remained an open question whether planar hypohamiltonian oriented graphs of order n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e07dcb7bdb35072216f40b1d1dce3bb9
https://doi.org/10.1002/jgt.22765
https://doi.org/10.1002/jgt.22765
Autor:
Carol T. Zamfirescu
Publikováno v:
JOURNAL OF GRAPH THEORY
Tutte proved that every planar 4-connected graph is hamiltonian. Thomassen showed that the same conclusion holds for the superclass of planar graphs with minimum degree at least 4 in which all vertex-deleted subgraphs are hamiltonian. We here prove t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f0003ec74151de811d184f191b46372
https://biblio.ugent.be/publication/01GQ0AM8QAQFDDQ14D9HKADFT3
https://biblio.ugent.be/publication/01GQ0AM8QAQFDDQ14D9HKADFT3
Publikováno v:
Journal of Graph Theory. 97:569-577
Spacapan recently showed that there exist 3-polytopes with non-Hamiltonian prisms, disproving a conjecture of Rosenfeld and Barnette. By adapting Spacapan's approach we strengthen his result in several directions. We prove that there exists an infini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef06c93b9652a2f43b7ceb85ccea57d
https://doi.org/10.1002/jgt.22672
https://doi.org/10.1002/jgt.22672
Autor:
Carol T. Zamfirescu, Jun Fujisawa
Publikováno v:
Discrete Applied Mathematics. 284:622-625
In this note, we consider triangulations of the plane. Ozeki and the second author asked whether there are non-hamiltonian 1-tough triangulations in which every two separating triangles are disjoint. We answer this question in the affirmative and str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94734abf1257cbf985c2d58d3dbb1042
https://doi.org/10.1016/j.dam.2020.03.053
https://doi.org/10.1016/j.dam.2020.03.053
Autor:
On-Hei Solomon Lo, Carol T. Zamfirescu
Publikováno v:
DISCRETE MATHEMATICS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d50b572cf65a97decf20a5ed1c16615d
https://doi.org/10.1016/j.disc.2022.113170
https://doi.org/10.1016/j.disc.2022.113170
Autor:
Carol T. Zamfirescu
Publikováno v:
SIAM JOURNAL ON DISCRETE MATHEMATICS
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constant $c$ such that there is an infinite family of 4-regular 4-connected graphs, each containing exactly $c$ hamiltonian cycles. We complement this by pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f0ffac55d2c6d040a60acf1b40259f0
http://arxiv.org/abs/2104.10020
http://arxiv.org/abs/2104.10020
Autor:
Carol T. Zamfirescu
Publikováno v:
DISCRETE MATHEMATICS
Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove that for ever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::095bb22187493956906c292745cf5833
https://doi.org/10.1016/j.disc.2022.112824
https://doi.org/10.1016/j.disc.2022.112824