Characterizations of k-traceable graphs and oriented graphs

Authors

  • Van Aardt, Susan A.
  • Prick, Marietjie
  • Dunbar, Jean E.
  • Nielsen, Morten H
  • Oellermann, Ortrud R.

Abstract

A(di)graph G is k-traceable(k ≥ 2) if every induced sub(di)graph of G that has order k is traceable. In particular,a 2-traceable graph is complete and a 2-traceable oriented graph is a tournament. In this paper we give structural characterizations of k-traceable graphs for each k ≤ 6. We also characterize,for k ≤ 4, those graphs that have a k-traceable orientation.

Published

2013-05-09

How to Cite

Van Aardt, Susan A., Prick, Marietjie, Dunbar, Jean E., Nielsen, Morten H, & Oellermann, Ortrud R. (2013). Characterizations of k-traceable graphs and oriented graphs. Utilitas Mathematica, 90. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/987

Issue

Vol. 90 (2013): Voluma 90, 2013

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.