Remarks on Hamiltonian properties of squares of graphs
Günter Schaar (1989)
Archivum Mathematicum
Similarity:
Günter Schaar (1989)
Archivum Mathematicum
Similarity:
A. Benkouar, Y. Manoussakis, V. Th. Paschos, R. Saad (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Fleischner, H., Horák, P., Širáň, J. (1993)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Igor Fabrici, Erhard Hexel, Stanislav Jendrol’ (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.
Pruesse, Gara, Ruskey, Frank (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hopkins, Brian (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Blain, Paul, Bowlin, Garry, Foisy, Joel, Hendricks, Jacob, LaCombe, Jason (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Fleischner, Herbert, Molina, Robert R., Smith, Ken W., West, Douglas B. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
L. Szamkołowicz (1982)
Banach Center Publications
Similarity: