Every 8-Traceable Oriented Graph Is Traceable

• Autorzy: Susan A. van Aardt
• Języki publikacji: EN

Abstrakty

EN

A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented graphs that are nontraceable. We show that every 8-traceable oriented graph is traceable.

Słowa kluczowe

EN

oriented graph; traceable; hypotraceable; k-traceable; generalized tournament

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 963-973

Daty

wydano

2017-11-27

otrzymano

2016-01-06

poprawiono

2016-08-10

zaakceptowano

2016-08-10

online

2017-09-02

Twórcy

autor

Susan A. van Aardt

• , 0003

Identyfikatory

DOI

10.7151/dmgt.1966