The purpose of this dissertation is to discuss the hamiltonicity of r-regular 3-connected planar graphs (rR3CPs) with faces of given types, in particular, r ∈ {3, 4}. In general, let Gr (k1, k2, . . . , kt) denotes the class of all rR3CPs whose faces are of only t types, namely k1-, k2-, . . . , kt-gons where ki ≥ 3, ki 6= kj ∀ i 6= j and i, j ∈ {1, 2, . . . , t}. The problem related to the hamiltonicity of 3R3CPs with only two types of faces are widely discussed and many results have been found. These results are reviewed in Chapter 2. Chapter 3 is devoted to the constructions of non-hamiltonian 3R3CPs with only three types of faces. Here, we show that G3(3, k, l) is empty if 11 ≤ k < l. We also show that for h 6= k 6= l, there exi...
Abstract It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructi...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractWe investigate graphs G such that the line graph L(G) is hamiltonian connected if and only i...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is ca...
AbstractA known result by the author in 1991 is that every 3-connected claw-free graph on at most 6δ...
Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Z...
In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltoni...
We introduce a new class of graphs which we call P₃-dominated graphs. This class properly contains a...
We introduce a new class of graphs which we call $P_3$-dominated graphs. This class properly contain...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
AbstractA graph is called l-ply Hamiltonian if it admits l edge-disjoint Hamiltonian circuits. The f...
We prove that, for large n, every 3-connected D-regular graph on n vertices with is Hamiltonian. Th...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
Abstract. We prove that, for large n, every 3-connected D-regular graph on n vertices with D ≥ n/4 i...
Abstract It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructi...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractWe investigate graphs G such that the line graph L(G) is hamiltonian connected if and only i...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
A graph G (V, E) is said to be Hamiltonian if it contains a spanning cycle. The spanning cycle is ca...
AbstractA known result by the author in 1991 is that every 3-connected claw-free graph on at most 6δ...
Let G be a k-regular 2-connected graph of order n. Jackson proved that G is hamiltonian if n 5 3k. Z...
In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltoni...
We introduce a new class of graphs which we call P₃-dominated graphs. This class properly contains a...
We introduce a new class of graphs which we call $P_3$-dominated graphs. This class properly contain...
AbstractIt is shown that for every value of an integer k, k⩾11, there exist 3-valent 3-connected pla...
AbstractA graph is called l-ply Hamiltonian if it admits l edge-disjoint Hamiltonian circuits. The f...
We prove that, for large n, every 3-connected D-regular graph on n vertices with is Hamiltonian. Th...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
Abstract. We prove that, for large n, every 3-connected D-regular graph on n vertices with D ≥ n/4 i...
Abstract It is well known that 3–regular graphs with arbitrarily large girth exist. Three constructi...
AbstractWe show that all 3-connected cubic planar graphs on 36 or fewer vertices are hamiltonian, th...
AbstractWe investigate graphs G such that the line graph L(G) is hamiltonian connected if and only i...