On a Conjecture of Lovász Concerning Bri
✍
Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 292 KB
In 1987, Lova ´sz conjectured that every brick G different from K 4 , C ¯6, and the Petersen graph has an edge e such that G -e is a matching covered graph with exactly one brick. Lova ´sz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and i