#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2006

2019

- This year (6)
- Last 5 years (25)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Carol T. Zamfirescu, Tudor Zamfirescu
- Journal of Graph Theory
- 2007

We present a planar hypohamiltonian graph on 48 vertices, and derive some consequences. Â© 2007 Wiley Periodicals, Inc. J Graph Theory 55: 338â€“342, 2007

- Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Ã–stergÃ¥rd, Ville Pettersson, Carol T. Zamfirescu
- Journal of Graph Theory
- 2017

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, aâ€¦ (More)

- Jan Goedgebeur, Carol T. Zamfirescu
- ArXiv
- 2016

In 2003, Cavicchioli et al. corrected an omission in the statement and proof of Fioriniâ€™s theorem from 1983 on hypohamiltonian snarks. However, their version of this theorem contains an unattainableâ€¦ (More)

- Carol T. Zamfirescu
- Journal of Graph Theory
- 2015

A graph G is almost hypohamiltonian if G is nonhamiltonian, there exists a vertex w such that G âˆ’ w is nonhamiltonian, and for any vertex v 6= w the graph G âˆ’ v is hamiltonian. We prove the existenceâ€¦ (More)

- Carol T. Zamfirescu
- Discrete Mathematics
- 2013

We give a brief introduction to the topic of twodimensional acute triangulations, mention results on related areas, survey existing achievements â€“ with emphasis on recent activity â€“ and list relatedâ€¦ (More)

- Ayesha Shabbir, Carol T. Zamfirescu, Tudor Zamfirescu
- EJGTA
- 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â€¦ (More)

- Jan Goedgebeur, Carol T. Zamfirescu
- ArXiv
- 2016

A graph G is hypohamiltonian if G is non-hamiltonian and G âˆ’ v is hamiltonian for every v âˆˆ V (G). In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave aâ€¦ (More)

- Carol T. Zamfirescu
- Electr. J. Comb.
- 2012

We prove that for every k > 0 there is an integer n0(k) such that, for every n > n0, there exists a hypohamiltonian graph which has order n and crossing number k.

We investigate here the hamiltonicity and traceability of a class of polytopes generalizing pyramids, prisms, and polytopes with Halin 1-skeleta.

- Carol T. Zamfirescu
- Journal of Graph Theory
- 2017

We call a graph G a platypus if G is non-hamiltonian, and for any vertex v in G, the graph Gâˆ’ v is traceable. Every hypohamiltonian and every hypotraceable graph is a platypus, but there existâ€¦ (More)