default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarol T. Zamfirescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Jarne Renders
, Shin-ichi Tokunaga, Carol T. Zamfirescu:
Domination of triangulated discs and maximal outerplanar graphs. Appl. Math. Comput. 473: 128648 (2024)- [j52]Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu:
Generation and new infinite families of K2-hypohamiltonian graphs. Discret. Math. 347(7): 113981 (2024) - [j51]Jan Goedgebeur, Thomas Gringore, Carol T. Zamfirescu:
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs. Discuss. Math. Graph Theory 44(4): 1631-1646 (2024) - [j50]Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian graphs: II. J. Graph Theory 105(4): 580-611 (2024) - [i10]Jan Goedgebeur, Kenta Noguchi, Jarne Renders, Carol T. Zamfirescu:
HIST-Critical Graphs and Malkevitch's Conjecture. CoRR abs/2401.04554 (2024) - 2023
- [j49]On-Hei Solomon Lo, Carol T. Zamfirescu:
Tight cycle spectrum gaps of cubic 3-connected toroidal graphs. Discret. Math. 346(1): 113170 (2023) - [j48]Carol T. Zamfirescu:
On a conjecture of Grünbaum on longest cycles. Eur. J. Comb. 114: 103791 (2023) - [j47]Carol T. Zamfirescu:
On the hamiltonicity of a planar graph and its vertex-deleted subgraphs. J. Graph Theory 102(1): 180-193 (2023) - [i9]Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian Graphs: II. CoRR abs/2311.05262 (2023) - [i8]Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu:
Generation and New Infinite Families of K2-hypohamiltonian Graphs. CoRR abs/2311.10593 (2023) - 2022
- [j46]Carol T. Zamfirescu:
Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap. Discret. Math. 345(6): 112824 (2022) - [j45]Gunnar Brinkmann, Sara Chiers, Carol T. Zamfirescu:
On 2-Factors Splitting an Embedded Graph into Two Plane Graphs. Graphs Comb. 38(3): 76 (2022) - [j44]Carol T. Zamfirescu:
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs. Inf. Process. Lett. 174: 106192 (2022) - [j43]Nico Van Cleemput, Carol T. Zamfirescu:
Hamiltonian cycles and 1-factors in 5-regular graphs. J. Comb. Theory B 154: 239-261 (2022) - [j42]Alewyn P. Burger, Johan P. de Wet, Marietjie Frick, Nico Van Cleemput, Carol T. Zamfirescu:
Planar hypohamiltonian oriented graphs. J. Graph Theory 100(1): 50-68 (2022) - [j41]Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu:
The connectivity of the dual. J. Graph Theory 101(2): 182-209 (2022) - [j40]Carol T. Zamfirescu:
Regular Graphs with Few Longest Cycles. SIAM J. Discret. Math. 36(1): 755-776 (2022) - [i7]Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu:
Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR abs/2211.08105 (2022) - 2021
- [j39]Igor Fabrici, Tomás Madaras, Maria Timkova, Nico Van Cleemput, Carol T. Zamfirescu:
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian. Appl. Math. Comput. 392: 125714 (2021) - [j38]Gábor Wiener, Maho Yokota, Carol T. Zamfirescu:
Spiders everywhere. Discret. Appl. Math. 289: 516-522 (2021) - [j37]Daiki Ikegami, Shun-ichi Maezawa, Carol T. Zamfirescu:
On 3-polytopes with non-Hamiltonian prisms. J. Graph Theory 97(4): 569-577 (2021) - [j36]Carol T. Zamfirescu:
K2-Hamiltonian Graphs: I. SIAM J. Discret. Math. 35(3): 1706-1728 (2021) - 2020
- [j35]Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu:
Structural and computational results on platypus graphs. Appl. Math. Comput. 386: 125491 (2020) - [j34]On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu:
Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j33]Jun Fujisawa, Carol T. Zamfirescu:
Non-hamiltonian 1-tough triangulations with disjoint separating triangles. Discret. Appl. Math. 284: 622-625 (2020) - [j32]Kenta Ozeki, Gábor Wiener, Carol T. Zamfirescu:
On minimum leaf spanning trees and a criticality notion. Discret. Math. 343(7): 111884 (2020) - [j31]Igor Fabrici, Jochen Harant, Tomás Madaras, Samuel Mohr, Roman Soták, Carol T. Zamfirescu:
Long cycles and spanning subgraphs of locally maximal 1-planar graphs. J. Graph Theory 95(1): 125-137 (2020) - [j30]Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu:
Graphs with few hamiltonian cycles. Math. Comput. 89(322): 965-991 (2020)
2010 – 2019
- 2019
- [j29]Nicolas Lichiardopol, Carol T. Zamfirescu:
On the size of maximally non-hamiltonian digraphs. Ars Math. Contemp. 16(1): 59-66 (2019) - [j28]Gunnar Brinkmann, Carol T. Zamfirescu:
Polyhedra with Few 3-Cuts are Hamiltonian. Electron. J. Comb. 26(1): 1 (2019) - [j27]Jan Goedgebeur, Carol T. Zamfirescu:
On almost hypohamiltonian graphs. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j26]Gunnar Brinkmann, Carol T. Zamfirescu:
Grinberg's Criterion. Eur. J. Comb. 75: 32-42 (2019) - [j25]Carol T. Zamfirescu:
On a Question of van Aardt et al. on Destroying All Longest Cycles. Graphs Comb. 35(2): 479-483 (2019) - [j24]Carol T. Zamfirescu:
Cubic vertices in planar hypohamiltonian graphs. J. Graph Theory 90(2): 189-207 (2019) - 2018
- [j23]Nico Van Cleemput, Carol T. Zamfirescu:
Regular non-hamiltonian polyhedral graphs. Appl. Math. Comput. 338: 192-206 (2018) - [j22]Jan Goedgebeur, Carol T. Zamfirescu:
On hypohamiltonian snarks and a theorem of Fiorini. Ars Math. Contemp. 14(2): 227-249 (2018) - [j21]Carol T. Zamfirescu:
Congruent triangles in arrangements of lines. Ars Math. Contemp. 14(2): 359-373 (2018) - [j20]Gábor Wiener, Carol T. Zamfirescu:
Gallai's question and constructions of almost hypotraceable graphs. Discret. Appl. Math. 243: 270-278 (2018) - [j19]Kenta Ozeki, Carol T. Zamfirescu:
Non-hamiltonian triangulations with distant separating triangles. Discret. Math. 341(7): 1900-1902 (2018) - [j18]Kenta Ozeki, Nico Van Cleemput, Carol T. Zamfirescu:
Hamiltonian properties of polyhedra with few 3-cuts - A survey. Discret. Math. 341(9): 2646-2660 (2018) - [j17]Jan Goedgebeur, Carol T. Zamfirescu:
Infinitely many planar cubic hypohamiltonian graphs of girth 5. J. Graph Theory 88(1): 40-45 (2018) - [j16]Carol T. Zamfirescu, Tudor I. Zamfirescu:
Every graph occurs as an induced subgraph of some hypohamiltonian graph. J. Graph Theory 88(4): 551-557 (2018) - [j15]Kenta Ozeki, Carol T. Zamfirescu:
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian. SIAM J. Discret. Math. 32(4): 2783-2794 (2018) - [i6]Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu:
Graphs with few Hamiltonian Cycles. CoRR abs/1812.05650 (2018) - 2017
- [j14]Jan Goedgebeur, Carol T. Zamfirescu:
Improved bounds for hypohamiltonian graphs. Ars Math. Contemp. 13(2): 235-257 (2017) - [j13]Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu:
Planar Hypohamiltonian Graphs on 40 Vertices. J. Graph Theory 84(2): 121-133 (2017) - [j12]Carol T. Zamfirescu:
On Non-Hamiltonian Graphs for which every Vertex-Deleted Subgraph Is Traceable. J. Graph Theory 86(2): 223-243 (2017) - [i5]Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu:
Structural and computational results on platypus graphs. CoRR abs/1712.05158 (2017) - 2016
- [j11]Liping Yuan, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Dissecting the square into five congruent parts. Discret. Math. 339(1): 288-298 (2016) - [j10]Alessandro Maddaloni, Carol T. Zamfirescu:
A cut locus for finite graphs and the farthest point mapping. Discret. Math. 339(1): 354-364 (2016) - [i4]Jan Goedgebeur, Carol T. Zamfirescu:
Improved bounds for hypohamiltonian graphs. CoRR abs/1602.07171 (2016) - [i3]Jan Goedgebeur, Carol T. Zamfirescu:
New results on hypohamiltonian and almost hypohamiltonian graphs. CoRR abs/1606.06577 (2016) - [i2]Jan Goedgebeur, Carol T. Zamfirescu:
On Hypohamiltonian Snarks and a Theorem of Fiorini. CoRR abs/1608.07164 (2016) - 2015
- [j9]Boris Schauerte, Carol T. Zamfirescu:
Small k-pyramids and the complexity of determining k. J. Discrete Algorithms 30: 13-20 (2015) - [j8]Carol T. Zamfirescu:
On Hypohamiltonian and Almost Hypohamiltonian Graphs. J. Graph Theory 79(1): 63-81 (2015) - 2013
- [j7]Carol T. Zamfirescu:
(2)-pancyclic graphs. Discret. Appl. Math. 161(7-8): 1128-1136 (2013) - [j6]Carol T. Zamfirescu:
Survey of two-dimensional acute triangulations. Discret. Math. 313(1): 35-49 (2013) - [j5]Lijie Jia, Liping Yuan, Carol T. Zamfirescu, Tudor Zamfirescu:
Balanced triangulations. Discret. Math. 313(20): 2178-2191 (2013) - [j4]Ayesha Shabbir, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Intersecting longest paths and longest cycles: A survey. Electron. J. Graph Theory Appl. 1(1): 56-76 (2013) - [i1]Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville Pettersson, Carol T. Zamfirescu:
Planar Hypohamiltonian Graphs on 40 Vertices. CoRR abs/1302.2698 (2013) - 2012
- [j3]Carol T. Zamfirescu:
Hypohamiltonian Graphs and their Crossing Number. Electron. J. Comb. 19(4): 12 (2012) - 2010
- [j2]Carol T. Zamfirescu:
An Infinite Family of Planar Non-Hamiltonian Bihomogeneously Traceable Oriented Graphs. Graphs Comb. 26(1): 141-146 (2010)
2000 – 2009
- 2007
- [j1]Carol T. Zamfirescu, Tudor Zamfirescu:
A planar hypohamiltonian graph with 48 vertices. J. Graph Theory 55(4): 338-342 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
