Most unbreakable murky graphs are bull-free
From MaRDI portal
Publication:2366956
DOI10.1007/BF02988303zbMath0779.05027OpenAlexW2035530125MaRDI QIDQ2366956
Publication date: 11 August 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02988303
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
This page was built for publication: Most unbreakable murky graphs are bull-free