Claw-Free and $$N(2,1,0)$$ N ( 2 , 1 , 0 ) -Free Graphs are Almost Net-Free
Crossref DOI link: https://doi.org/10.1007/s00373-014-1506-1
Published Online: 2015-01-10
Published Print: 2015-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Furuya, Michitaka
Tsuchiya, Shoichi
Text and Data Mining valid from 2015-01-10