Forbidden configurations for hypohamiltonian graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2018 English Publisher:AGHU University of Science and Technology PressJournal:Opuscula Mathematica, volume 38, page 357 (issn: 1232-9274,

Copyright policy )

Authors: Igor Fabrici; Tomáš Madaras; Mária Timková;

doi: 10.7494/opmath.2018.38.3.357

Forbidden configurations for hypohamiltonian graphs

- Summary
- Subjects
- Metrics

Abstract

Summary: A graph \(G\) is called hypohamiltonian if \(G\) is not Hamiltonian, but \(G-x\) is Hamiltonian for each vertex \(x\) of \(G\). We present a list of 331 forbidden configurations which do not appear in hypohamiltonian graphs.

Related Organizations

Technical University of Košice
Slovakia

Keywords

T57-57.97, Eulerian and Hamiltonian graphs, Applied mathematics. Quantitative methods, hypohamiltonian graph, long cycle, forbidden configuration, Paths and cycles

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average