Add to ORKGWe show that an edge-dominating cycle in a 2K2-free graph can be found in polynomial time; this implies that every 1k−1-tough 2K2-free graph admits a k-walk, and it can be found in polynomial time. For this class of graphs, this proves a long-standing conjecture due to Jackson and Wormald [k-walks of graphs, Australas. J. Combin.2 (1990) 135–146]. Furthermore, we prove that for any ϵ>0 every (1+ϵ)-tough 2K2-free graph is prism-Hamiltonian and give an effective construction of a Hamiltonian cycle in the corresponding prism, along with few other similar results
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident w...
AbstractWe show that every K4-minor-free graph with toughness greater than 4/7 has a 2-walk, i.e., a...
After a review of Hamiltonicity of graphs and related concepts, we discuss several generalizations o...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A...
International audienceIn this paper, we prove that, given a clique-width k-expression of an n-vertex...
The Hamiltonian Cycle problem asks if an $n$-vertex graph $G$ has a cycle passing through all vertic...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cy...
AbstractA number of results in hamiltonian graph theory are of the form “P1 implies P2”, where P1 is...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
A number of results in hamiltonian graph theory are of the form P1 implies P2, where P1 is a propert...
In the first part of this thesis, some new sufficient conditions for a graph to be Hamiltonian and s...
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident w...
AbstractWe show that every K4-minor-free graph with toughness greater than 4/7 has a 2-walk, i.e., a...
After a review of Hamiltonicity of graphs and related concepts, we discuss several generalizations o...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
The toughness of a (noncomplete) graph G is the minimum value of t for which there is a vertex cut A...
International audienceIn this paper, we prove that, given a clique-width k-expression of an n-vertex...
The Hamiltonian Cycle problem asks if an $n$-vertex graph $G$ has a cycle passing through all vertic...
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices o...
In this paper, we prove that, given a clique-width k-expression of an n-vertex graph, Hamiltonian Cy...
AbstractA number of results in hamiltonian graph theory are of the form “P1 implies P2”, where P1 is...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
AbstractBill Jackson has proved that every 2-connected, k-regular graph on at most 3k vertices is ha...
A number of results in hamiltonian graph theory are of the form P1 implies P2, where P1 is a propert...
In the first part of this thesis, some new sufficient conditions for a graph to be Hamiltonian and s...
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident w...
AbstractWe show that every K4-minor-free graph with toughness greater than 4/7 has a 2-walk, i.e., a...