Premium
The graphs for which all strong orientations are hamiltonian
Author(s) -
Grötschel Martin,
Harary Frank
Publication year - 1979
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190030304
Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , hamiltonian path , indifference graph , chordal graph , pancyclic graph , graph , discrete mathematics , 1 planar graph , mathematical optimization
We show that the only nontrivial strongly orientable graphs for which every strong oreintation is Hamiltonian are complete graphs and cycles.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom