Hypohamiltonian graphs and their crossing number

Carol T. Zamfirescu

Hypohamiltonian graphs and their crossing number

Carol T. Zamfirescu

School of Computer, Data & Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

We prove that for every k >= 0 there is an integer n(0)(k) such that, for every n >= n(0), there exists a hypohamiltonian graph which has order n and crossing number k.

Original language	English
Article number	P12
Number of pages	7
Journal	Electronic Journal of Combinatorics
Volume	19
Issue number	4
Publication status	Published - 25 Oct 2012

Keywords

Hypohamiltonian graph
Crossing number

Cite this

@article{640cc97578334894835f874ec6058333,

title = "Hypohamiltonian graphs and their crossing number",

abstract = "We prove that for every k >= 0 there is an integer n(0)(k) such that, for every n >= n(0), there exists a hypohamiltonian graph which has order n and crossing number k.",

keywords = "Hypohamiltonian graph, Crossing number",

author = "Zamfirescu, \{Carol T.\}",

year = "2012",

month = oct,

day = "25",

language = "English",

volume = "19",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Australian National University",

number = "4",

}

TY - JOUR

T1 - Hypohamiltonian graphs and their crossing number

AU - Zamfirescu, Carol T.

PY - 2012/10/25

Y1 - 2012/10/25

N2 - We prove that for every k >= 0 there is an integer n(0)(k) such that, for every n >= n(0), there exists a hypohamiltonian graph which has order n and crossing number k.

AB - We prove that for every k >= 0 there is an integer n(0)(k) such that, for every n >= n(0), there exists a hypohamiltonian graph which has order n and crossing number k.

KW - Hypohamiltonian graph

KW - Crossing number

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=web_of_science_starterapi&SrcAuth=WosAPI&KeyUT=WOS:000310433600006&DestLinkType=FullRecord&DestApp=WOS_CPL

M3 - Article

SN - 1077-8926

VL - 19

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 4

M1 - P12

ER -

Hypohamiltonian graphs and their crossing number

Abstract

Keywords

Other files and links

Fingerprint

Cite this