A　graph　is　said　to　be　(Formula　presented.)　-free　if　it　does　not　contain　any　subdivision　of　(Formula　presented.)　as　an　induced　subgraph.　Lévêque,　Maffray　and　Trotignon　conjectured　that　every　(Formula　presented.)　-free　graph　is　4-colorable.　In　this　paper,　we　show　that　this　conjecture　is　true　for　the　class　of　{　(Formula　presented.),　diamond,　bowtie}-free　graphs,　where　a　diamond　is　the　graph　obtained　from　(Formula　presented.)　by　removing　one　edge　and　a　bowtie　is　the　graph　consisting　of　two　triangles　with　one　vertex　identified.　©　2020　Wiley　Periodicals　LLC