Academic Bibliography

Search 200 years of publications by Ghent University researchers.

dr. Carol Zamfirescu

Faculty of Sciences > Department of Applied mathematics, computer science and statistics

Work address: Krijgslaan 281, S9
9000 Gent
Email: Carol.Zamfirescu@UGent.be
ORCID iD: 0000-0002-9673-410X

Show Sort by

Add to list
- Journal Article
- A1
- open access
Spiders everywhere

Gábor Wiener, Maho Yokota and Carol Zamfirescu (UGent)

(2021) DISCRETE APPLIED MATHEMATICS. 289. p.516-522
Add to list
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian

Igor Fabrici, Tomáš Madaras, Mária Timková, Nicolas Van Cleemput (UGent) and Carol Zamfirescu (UGent)

(2021) APPLIED MATHEMATICS AND COMPUTATION. 392.
Add to list
Structural and computational results on platypus graphs

Jan Goedgebeur (UGent) , Addie Neyt and Carol Zamfirescu (UGent)

(2020) APPLIED MATHEMATICS AND COMPUTATION. 386.
Add to list
Non-hamiltonian 1-tough triangulations with disjoint separating triangles

Jun Fujisawa and Carol Zamfirescu (UGent)

(2020) DISCRETE APPLIED MATHEMATICS. 284. p.622-625
Add to list
Long cycles and spanning subgraphs of locally maximal 1-planar graphs

I. Fabrici, J. Harant, T. Madaras, S. Mohr, R. Soták and Carol Zamfirescu (UGent)

(2020) JOURNAL OF GRAPH THEORY. 95(1). p.125-137
Add to list
On minimum leaf spanning trees and a criticality notion

Kenta Ozeki, Gábor Wiener and Carol Zamfirescu (UGent)

(2020) DISCRETE MATHEMATICS. 343(7).
Add to list
- Journal Article
- A1
- open access
Shortness coefficient of cyclically 4-edge-connected cubic graphs

On-Hei S. Lo, Jens M. Schmidt, Nicolas Van Cleemput (UGent) and Carol Zamfirescu (UGent)

(2020) ELECTRONIC JOURNAL OF COMBINATORICS. 27(1).
Add to list
Graphs with few hamiltonian cycles

Jan Goedgebeur (UGent) , Barbara Meersman and Carol Zamfirescu (UGent)

(2020) MATHEMATICS OF COMPUTATION. 89(322). p.965-991
Add to list
- Journal Article
- A1
- open access
On almost hypohamiltonian graphs

Jan Goedgebeur (UGent) and Carol Zamfirescu (UGent)

(2019) DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE. 21(4).
Add to list
- Journal Article
- A1
- open access
Polyhedra with few 3-cuts are hamiltonian

Gunnar Brinkmann (UGent) and Carol Zamfirescu (UGent)

(2019) ELECTRONIC JOURNAL OF COMBINATORICS. 26(1).

1
2
3
4
5

Next →