The following pages link to Carol T. Zamfirescu (Q390296):
Displaying 50 items.
- Balanced triangulations (Q390297) (← links)
- Lattice graphs with non-concurrent longest cycles (Q481029) (← links)
- Dissecting the square into five congruent parts (Q501065) (← links)
- A cut locus for finite graphs and the farthest point mapping (Q501076) (← links)
- An infinite family of planar non-Hamiltonian bihomogeneously traceable oriented graphs (Q604660) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles (Q777448) (← links)
- Grinberg's criterion (Q1621061) (← links)
- (Q1732034) (redirect page) (← links)
- Polyhedra with few 3-cuts are Hamiltonian (Q1732035) (← links)
- On a question of van Aardt et al. on destroying all longest cycles (Q1741587) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- Non-Hamiltonian triangulations with distant separating triangles (Q1752660) (← links)
- Survey of two-dimensional acute triangulations (Q1759809) (← links)
- (2)-pancyclic graphs (Q1949119) (← links)
- Hypohamiltonian graphs and their crossing number (Q1953317) (← links)
- Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs (Q2059878) (← links)
- Tight cycle spectrum gaps of cubic 3-connected toroidal graphs (Q2092397) (← links)
- On 2-factors splitting an embedded graph into two plane graphs (Q2121487) (← links)
- Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap (Q2124617) (← links)
- On minimum leaf spanning trees and a criticality notion (Q2182204) (← links)
- Spiders everywhere (Q2217501) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- Shortness coefficient of cyclically 4-edge-connected cubic graphs (Q2294112) (← links)
- Regular non-Hamiltonian polyhedral graphs (Q2335747) (← links)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (Q2662552) (← links)
- Hamiltonian cycles and 1-factors in 5-regular graphs (Q2668019) (← links)
- (Q2860809) (← links)
- Planar Hypohamiltonian Graphs on 40 Vertices (Q2958202) (← links)
- Hamiltonian properties of generalized pyramids (Q3092763) (← links)
- (Q3402528) (← links)
- A planar hypohamiltonian graph with 48 vertices (Q3594955) (← links)
- Every 4-Connected Graph with Crossing Number 2 is Hamiltonian (Q4561263) (← links)
- Infinitely many planar cubic hypohamiltonian graphs of girth 5 (Q4575516) (← links)
- On hypohamiltonian snarks and a theorem of Fiorini (Q4577866) (← links)
- Congruent triangles in arrangements of lines (Q4577873) (← links)
- Every graph occurs as an induced subgraph of some hypohamiltonian graph (Q4581282) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- Cubic vertices in planar hypohamiltonian graphs (Q4995569) (← links)
- $K_2$-Hamiltonian Graphs: I (Q5009329) (← links)
- 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles (Q5026982) (← links)
- Long cycles and spanning subgraphs of locally maximal 1‐planar graphs (Q5066913) (← links)
- Regular Graphs with Few Longest Cycles (Q5067426) (← links)
- Intersecting longest paths and longest cycles: A survey (Q5177022) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- On almost hypohamiltonian graphs (Q5226849) (← links)
- On Hypohamiltonian and Almost Hypohamiltonian Graphs (Q5251202) (← links)
- (Q5296591) (← links)
