Every 8-Traceable Oriented Graph Is Traceable
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...
Main Author: | Aardt Susan A. van |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2017-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1966 |
Similar Items
-
Energy Conditions for Hamiltonian and Traceable Graphs
by: Rao Li
Published: (2019-03-01) -
Domination number and traceability of graphs
by: Rao Li
Published: (2020-07-01) -
THE RELEVANCE OF TRACEABILITY IN THE FOOD CHAIN
by: Ene Corin
Published: (2013-06-01) -
Connected domination number and traceable graphs
by: Phillip Mafuta
Published: (2023-09-01) -
Traceability of locally hamiltonian and locally traceable graphs
by: Johan De Wet, et al.
Published: (2016-07-01)