Claw-free and \(N(2,1,0)\)-free graphs are almost net-free
From MaRDI portal
Publication:897278
DOI10.1007/s00373-014-1506-1zbMath1327.05288OpenAlexW2781478604MaRDI QIDQ897278
Michitaka Furuya, Shoichi Tsuchiya
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1506-1
Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Characterizing the difference between graph classes defined by forbidden pairs including the claw
Cites Work
This page was built for publication: Claw-free and \(N(2,1,0)\)-free graphs are almost net-free