Math Conjectures
HomeReferencesBauerEtAl1990Tough

BauerEtAl1990Tough

Not every 2-tough graph is Hamiltonian

Douglas Bauer and Hajo J. Broersma and Henk Jan Veldman

misc2000
Citation key
BauerEtAl1990Tough
Year
2000
Cited by
1 catalog records
Direct source
Available

Reference note

Why this source is in the ledger

Douglas Bauer, Hajo J. Broersma, and Henk Jan Veldman, “Not every 2-tough graph is Hamiltonian,” Discrete Applied Mathematics 99 (2000), 317–321, DOI: 10.1016/S0166-218X(99)00141-9.

Catalog connections

Conjectures citing this source

Source record

Bibliographic fields

Inspect the parsed BibTeX fields
author
Douglas Bauer and Hajo J. Broersma and Henk Jan Veldman
doi
10.1016/S0166-218X(99)00141-9
note
Douglas Bauer, Hajo J. Broersma, and Henk Jan Veldman, “Not every 2-tough graph is Hamiltonian,” Discrete Applied Mathematics 99 (2000), 317--321, DOI: 10.1016/S0166-218X(99)00141-9.
title
Not every 2-tough graph is Hamiltonian
year
2000