Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Traceability in Claw-Free Graphs Through Induced Bulls

Rao Li1
1Dept. of Mathematical Sciences University of Memphis Memphis, TN 38152
  • Published: 28/02/2000

Abstract

It is shown that if a graph \(G\) is connected, claw-free, and such that the vertices of degree 1 of every induced bull have a common neighbor in \(G\), then \(G\) is traceable.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Rao Li. Traceability in Claw-Free Graphs Through Induced Bulls[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 032. 193-201. DOI: .