2009
DOI: 10.1016/j.ipl.2009.07.015
|View full text |Cite
|
Sign up to set email alerts
|

A clique-covering sufficient condition for hamiltonicity of graphs

Abstract: International audienceA graph is hamiltonian if it contains a cycle which goes through all vertices exactly once. Determining if a graph is hamiltonian is known as NP-complete problem and no satisfactory characterization for hamiltonian graphs has been found. There are several necessary conditions for hamiltonicity and since the seminal work of Dirac in 1952, many sufficient conditions were found. These conditions are usually expressed in terms of node degree, connectivity, density, toughness, independent sets… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
13
0

Year Published

2010
2010
2013
2013

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 6 publications
0
13
0
Order By: Relevance
“…This condition is a generalization of a result from [6]. The main result of [1] states that if there exists an eulerian clique-covering of a graph G then the graph is hamiltonian. A clique-covering is eulerian if it is pairwise-joint and evenly-joint (cf.…”
Section: Introductionmentioning
confidence: 82%
See 4 more Smart Citations
“…This condition is a generalization of a result from [6]. The main result of [1] states that if there exists an eulerian clique-covering of a graph G then the graph is hamiltonian. A clique-covering is eulerian if it is pairwise-joint and evenly-joint (cf.…”
Section: Introductionmentioning
confidence: 82%
“…In [1], a sufficient condition for hamiltonicity of graphs based on clique-coverings is introduced. This condition is a generalization of a result from [6].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations