M\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs
Discrete Mathematics
2010-03-30 v2
Abstract
A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts 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.
Keywords
Cite
@article{arxiv.0809.4839,
title = {M\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs},
author = {Jean-Luc Fouquet and Jean-Marie Vanherpe},
journal= {arXiv preprint arXiv:0809.4839},
year = {2010}
}