Traceability in small claw-free graphs

Authors

  • Harris, John M.
  • Mossinghoff, Michael J.

Abstract

We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices and a minimal number of edges. This complements a result of Matthews on Hamiltonian graphs.

Published

2006-06-09

How to Cite

Harris, John M., & Mossinghoff, Michael J. (2006). Traceability in small claw-free graphs. Utilitas Mathematica, 70. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/420

Issue

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.