International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect matchings. This confirms an old conjecture of Lovász and Plummer
Berge and Fulkerson conjectured that for each cubic bridgeless graph there are six perfect matchings...
We propose three new conjectures on perfect matchings in cubic graphs. The weakest conjecture is imp...
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph contains three perfect...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
The famous conjecture of Lovász and Plummer, very recently proven by Esperet et al. (2011), asserts...
A well-known conjecture by Lovász and Plummer from the 1970s asserting that a bridgeless cubic graph...
International audienceWe prove that every n-vertex cubic bridgeless graph has at least n/2 perfect m...
AbstractWe show that every cubic bridgeless graph with n vertices has at least 3n/4−10 perfect match...
AbstractLovász and Plummer conjectured in the 1970’s that cubic bridgeless graphs have exponentially...
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as f...
Lovász and Plummer conjectured that there exists a fixed positive con-stant c such that every cubic...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
A well-known conjecture by Lovász and Plummer from the 1970s asserted that a bridgeless cubic graph ...
Berge and Fulkerson conjectured that for each cubic bridgeless graph there are six perfect matchings...
We propose three new conjectures on perfect matchings in cubic graphs. The weakest conjecture is imp...
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph contains three perfect...
International audienceWe show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect ...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
The famous conjecture of Lovász and Plummer, very recently proven by Esperet et al. (2011), asserts...
A well-known conjecture by Lovász and Plummer from the 1970s asserting that a bridgeless cubic graph...
International audienceWe prove that every n-vertex cubic bridgeless graph has at least n/2 perfect m...
AbstractWe show that every cubic bridgeless graph with n vertices has at least 3n/4−10 perfect match...
AbstractLovász and Plummer conjectured in the 1970’s that cubic bridgeless graphs have exponentially...
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as f...
Lovász and Plummer conjectured that there exists a fixed positive con-stant c such that every cubic...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
International audienceLovász and Plummer conjectured in the 1970's that cubic bridgeless graphs have...
A well-known conjecture by Lovász and Plummer from the 1970s asserted that a bridgeless cubic graph ...
Berge and Fulkerson conjectured that for each cubic bridgeless graph there are six perfect matchings...
We propose three new conjectures on perfect matchings in cubic graphs. The weakest conjecture is imp...
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph contains three perfect...
DOI
Add to ORKG