Add to ORKGOn the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph $G$ may have in order to guarantee that $G^2$ is hamiltonian, hamiltonian connected, respectively. Such an approach was already developed for hamiltonian total graphs.Comment: 17 page
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the H...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
AbstractA graph G is a line-critical block if κ(G) = 2 and if for any line e of G the graph G − e ha...
Druhá mocnina grafu G, značí se G^2, je graf, který získáme z G spojením hranou každé dva nesousední...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
A graph G=(V, E) is called a complete semi-bigraph and denoted by K'(l, m) if the vertex set can be ...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
A complete grid G/sub m,n/ is a graph having m x n pertices that are connected to form a rectangular...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the H...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
AbstractThe square G2 of a graph G is the graph having the same vertex set as G and two vertices are...
AbstractA graph G is a line-critical block if κ(G) = 2 and if for any line e of G the graph G − e ha...
Druhá mocnina grafu G, značí se G^2, je graf, který získáme z G spojením hranou každé dva nesousední...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractLet B be a block (finite connected graph without cut-vertices) with at least four vertices a...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractIn this paper we show that the entire graph of a bridgeless connected plane graph is hamilto...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the ...
A graph G=(V, E) is called a complete semi-bigraph and denoted by K'(l, m) if the vertex set can be ...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
A complete grid G/sub m,n/ is a graph having m x n pertices that are connected to form a rectangular...
AbstractIt was claimed by Gould (1981) that if G is a connected graph of order at least 3 such that ...
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the H...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...