Non-intersecting perfect matchings in cubic graphs (Extended abstract)

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 2007 English Publisher:Elsevier BVJournal:Electronic Notes in Discrete Mathematics, volume 28, pages 293-299 (issn: 1571-0653,

Copyright policy )

Authors: Tomás Kaiser; André Raspaud;

doi: 10.1016/j.endm.2007.01.042

Non-intersecting perfect matchings in cubic graphs (Extended abstract)

- Summary
- Related research
  (7)
- Metrics

Abstract

Abstract A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. The method can be used to prove a special case of a conjecture of E. Macajova and M. Skoviera on Fano colorings of cubic graphs.

Related Organizations

University of West Bohemia
Czech Republic
University of Bordeaux
France
Paris 8 University
France
University of Bordeaux
France

7 Research products, page 1 of 1

Perfect matchings with restricted intersection in cubic graphs
2010IsAmongTopNSimilarDocuments
Shortest circuit covers of signed graphs
2019IsAmongTopNSimilarDocuments
On hypohamiltonian snarks and a theorem of Fiorini
2017IsAmongTopNSimilarDocuments
On the Smallest Snarks with Oddness 4 and Connectivity 2
2018IsAmongTopNSimilarDocuments
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
2019IsAmongTopNSimilarDocuments
Odd Decompositions of Eulerian Graphs
2017IsAmongTopNSimilarDocuments
The chromatic spectrum of signed graphs
2016IsAmongTopNSimilarDocuments

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average