Orientations of hamiltonian cycles in large digraphs

Adam Paweł Wojda

doi:10.1002/jgt.3190100210

Orientations of hamiltonian cycles in large digraphs

Adam Paweł Wojda

Research output: Contribution to journal › Article › Academic

5 Citations (Scopus)

Abstract

We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian cycle.

Original language	Undefined
Pages (from-to)	211-218
Journal	Journal of graph theory
Volume	10
Issue number	2
DOIs	https://doi.org/10.1002/jgt.3190100210
Publication status	Published - 1986
Externally published	Yes

Keywords

IR-70816

Access to Document

10.1002/jgt.3190100210

Wojda86orientations
open

Cite this

@article{749b66393fc64f539b94e8ee62778df4,

title = "Orientations of hamiltonian cycles in large digraphs",

abstract = "We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian cycle.",

keywords = "IR-70816",

author = "Wojda, {Adam Pawe{\l}}",

year = "1986",

doi = "10.1002/jgt.3190100210",

language = "Undefined",

volume = "10",

pages = "211--218",

journal = "Journal of graph theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

T1 - Orientations of hamiltonian cycles in large digraphs

AU - Wojda, Adam Paweł

PY - 1986

Y1 - 1986

N2 - We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian cycle.

AB - We prove that, with some exceptions, every digraph with n ≥ 9 vertices and at least (n - 1) (n - 2) + 2 arcs contains all orientations of a Hamiltonian cycle.

KW - IR-70816

U2 - 10.1002/jgt.3190100210

DO - 10.1002/jgt.3190100210

M3 - Article

VL - 10

SP - 211

EP - 218

JO - Journal of graph theory

JF - Journal of graph theory

SN - 0364-9024

IS - 2

ER -