Carol T. Zamfirescu

Eur. J. Comb., December, 2023

On the hamiltonicity of a planar graph and its vertex-deleted subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

Tight cycle spectrum gaps of cubic 3-connected toroidal graphs.

[BibT_eX]

[DOI]

On-Hei Solomon Lo

,

Discret. Math., 2023

Generation and New Infinite Families of K2-hypohamiltonian Graphs.

[BibT_eX]

[DOI]

,

Jarne Renders

,

CoRR, 2023

K2-Hamiltonian Graphs: II.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2023

Regular Graphs with Few Longest Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Planar hypohamiltonian oriented graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2022

The connectivity of the dual.

[BibT_eX]

[DOI]

Drago Bokal

,

,

J. Graph Theory, 2022

Hamiltonian cycles and 1-factors in 5-regular graphs.

[BibT_eX]

[DOI]

Nico Van Cleemput

,

J. Comb. Theory, Ser. B, 2022

Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

On 2-Factors Splitting an Embedded Graph into Two Plane Graphs.

[BibT_eX]

[DOI]

,

Sara Chiers

,

Graphs Comb., 2022

Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap.

[BibT_eX]

[DOI]

Discret. Math., 2022

Few hamiltonian cycles in graphs with one or two vertex degrees.

[BibT_eX]

[DOI]

,

,

,

,

CoRR, 2022

K2-Hamiltonian Graphs: I.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

On 3-polytopes with non-Hamiltonian prisms.

[BibT_eX]

[DOI]

Daiki Ikegami

,

Shun-ichi Maezawa

,

J. Graph Theory, 2021

Spiders everywhere.

[BibT_eX]

[DOI]

Gábor Wiener

,

Maho Yokota

,

Discret. Appl. Math., 2021

Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2021

Graphs with few hamiltonian cycles.

[BibT_eX]

[DOI]

,

Barbara Meersman

,

Math. Comput., 2020

Long cycles and spanning subgraphs of locally maximal 1-planar graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2020

On minimum leaf spanning trees and a criticality notion.

[BibT_eX]

[DOI]

,

Gábor Wiener

,

Discret. Math., 2020

Non-hamiltonian 1-tough triangulations with disjoint separating triangles.

[BibT_eX]

[DOI]

Jun Fujisawa

,

Discret. Appl. Math., 2020

Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2020

Structural and computational results on platypus graphs.

[BibT_eX]

[DOI]

,

Addie Neyt

,

Appl. Math. Comput., 2020

Cubic vertices in planar hypohamiltonian graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

On a Question of van Aardt et al. on Destroying All Longest Cycles.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Grinberg's Criterion.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

On almost hypohamiltonian graphs.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2019

Polyhedra with Few 3-Cuts are Hamiltonian.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2019

On the size of maximally non-hamiltonian digraphs.

[BibT_eX]

[DOI]

Nicolas Lichiardopol

,

Ars Math. Contemp., 2019

Every 4-Connected Graph with Crossing Number 2 is Hamiltonian.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2018

Every graph occurs as an induced subgraph of some hypohamiltonian graph.

[BibT_eX]

[DOI]

,

Tudor I. Zamfirescu

J. Graph Theory, 2018

Infinitely many planar cubic hypohamiltonian graphs of girth 5.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2018

Non-hamiltonian triangulations with distant separating triangles.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

Hamiltonian properties of polyhedra with few 3-cuts - A survey.

[BibT_eX]

[DOI]

,

Nico Van Cleemput

,

Discret. Math., 2018

Gallai's question and constructions of almost hypotraceable graphs.

[BibT_eX]

[DOI]

Gábor Wiener

,

Discret. Appl. Math., 2018

Congruent triangles in arrangements of lines.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

On hypohamiltonian snarks and a theorem of Fiorini.

[BibT_eX]

[DOI]

,

Ars Math. Contemp., 2018

Regular non-hamiltonian polyhedral graphs.

[BibT_eX]

[DOI]

Nico Van Cleemput

,

Appl. Math. Comput., 2018

On Non-Hamiltonian Graphs for which every Vertex-Deleted Subgraph Is Traceable.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Planar Hypohamiltonian Graphs on 40 Vertices.

[BibT_eX]

[DOI]

Mohammadreza Jooyandeh

,

Brendan D. McKay

,

Patric R. J. Östergård

,

Ville H. Pettersson

,

J. Graph Theory, 2017

Improved bounds for hypohamiltonian graphs.

[BibT_eX]

[DOI]

,

Ars Math. Contemp., 2017

Dissecting the square into five congruent parts.

[BibT_eX]

[DOI]

Liping Yuan

,

,

Tudor I. Zamfirescu

Discret. Math., 2016

A cut locus for finite graphs and the farthest point mapping.

[BibT_eX]

[DOI]

Alessandro Maddaloni

,

Discret. Math., 2016

New results on hypohamiltonian and almost hypohamiltonian graphs.

[BibT_eX]

[DOI]

,

CoRR, 2016

On Hypohamiltonian and Almost Hypohamiltonian Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Small k-pyramids and the complexity of determining k.

[BibT_eX]

[DOI]

Boris Schauerte

,

J. Discrete Algorithms, 2015

Intersecting longest paths and longest cycles: A survey.

[BibT_eX]

[DOI]

Ayesha Shabbir

,

,

Tudor I. Zamfirescu

Electron. J. Graph Theory Appl., 2013

Survey of two-dimensional acute triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2013

Balanced triangulations.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2013

(2)-pancyclic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Hypohamiltonian Graphs and their Crossing Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

An Infinite Family of Planar Non-Hamiltonian Bihomogeneously Traceable Oriented Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

A planar hypohamiltonian graph with 48 vertices.

[BibT_eX]

[DOI]