Document Zbl 1266.05079

Structured Search

Help

Examples

Geometry Search for the term Geometry in any field. Queries are case-independent.

Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.

"Topological group" Phrases (multi-words) should be set in "straight quotation marks".

au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.

Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.

Quasi* map* py: 1989 The resulting documents have publication year 1989.

so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.

"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.

dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.

py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).

la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Fields

any	anywhere
an	internal document identifier
au	author, editor
ai	internal author identifier
ti	title
la	language
so	source
ab	review, abstract
py	publication year
rv	reviewer
cc	MSC code
ut	keyword
dt	document type (j: journal article; b: book; a: book article)

Operators

a & b	logic and
a \| b	logic or
!ab	logic not
abc*	right wildcard
"ab c"	phrase
(ab c)	parentheses

Zamfirescu, Carol T.

Hypohamiltonian graphs and their crossing number. (English) Zbl 1266.05079

Electron. J. Comb. 19, No. 4, Research Paper P12, 7 p. (2012).

Summary: We prove that for every \(k \geq 0\) there is an integer \(n_0(k)\) such that, for every \(n \geq n_0\), there exists a hypohamiltonian graph which has order \(n\) and crossing number \(k\).

Cited in 4 Documents

MSC:

05C45	Eulerian and Hamiltonian graphs
05C10	Planar graphs; geometric and topological aspects of graph theory

Keywords:

hypohamiltonian graphs; crossing number

PDF BibTeX XML Cite

Full Text: Link