Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs

Frank Bullock, Marietjie Frick, Joy Singleton. Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs. Discrete Mathematics, 307(11-12):1266-1275, 2007. [doi]

@article{BullockFS07,
  title = {Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs},
  author = {Frank Bullock and Marietjie Frick and Joy Singleton},
  year = {2007},
  doi = {10.1016/j.disc.2005.11.063},
  url = {http://dx.doi.org/10.1016/j.disc.2005.11.063},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BullockFS07},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {307},
  number = {11-12},
  pages = {1266-1275},
}