Perfect matchings with restricted intersection in cubic graphs
type: Item
instance of: scholarly article
title: Perfect matchings with restricted intersection in cubic graphs
zbMATH Open document ID: 1218.05137
author: Tomáš Kaiser
author: André Raspaud
published in: European Journal of Combinatorics
publication date: 2010-06-17T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5722039
zbMATH Keywords: bridgeless cubic graph
zbMATH Keywords: three perfect matchings with empty intersection
MaRDI profile type: Publication
full work available at URL: j.ejc.2009.11.007
OpenAlex ID: W1989226131
cites work: Q4947393
cites work: Fulkerson's conjecture and circuit covers
cites work: Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Colouring of cubic graphs by Steiner triple systems
cites work: Fano colourings of cubic graphs and the Fulkerson conjecture
cites work: Sparsely intersecting perfect matchings in cubic graphs
cites work: On a conjecture of Fan and Raspaud
cites work: Graphs on surfaces
DOI: 10.1016/J.EJC.2009.11.007
Recommended article: Non-intersecting perfect matchings in cubic graphs (Extended abstract)
Recommended article: Perfect matchings in planar cubic graphs
Recommended article: Unions of perfect matchings in cubic graphs
Recommended article: Q3424884
Recommended article: Sparsely intersecting perfect matchings in cubic graphs
Recommended article: Q4980958
Recommended article: Connected cubic graphs with the maximum number of perfect matchings
Recommended article: A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs
Recommended article: An improved linear bound on the number of perfect matchings in cubic graphs
Recommended article: Perfect matchings in claw-free cubic graphs
description: scientific article; zbMATH DE number 5722039