Connectivity of claw-free maximal nontraceable graphs

Authors

  • Dunbar, Jean E.
  • Harris, John M.
  • Frick, Marietjie
  • Van Aardt, Susan

Abstract

It is known that there exists a 2-connected claw-free maximal nontraceable graph of order n for every n ≥ 18. We demonstrate the existence of a 3-connected claw-free maximal nontraceable graph of order n for every n ≥ 60.

Published

2011-05-09

How to Cite

Dunbar, Jean E., Harris, John M., Frick, Marietjie, & Van Aardt, Susan. (2011). Connectivity of claw-free maximal nontraceable graphs. Utilitas Mathematica, 84. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/807

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.