Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free

Michitaka Furuya, Shoichi Tsuchiya. Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free. Graphs and Combinatorics, 31(6):2201-2205, 2015. [doi]

Abstract

Abstract is missing.