Kaiser and Raspaud conjecture on cubic Graphs with few vertices
Résumé
A conjecture of Kaiser and Raspaud [6] asserts (in a special form due to Macajová and Skoviera) that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)