An equivalent formulation of the Fan-Raspaud Conjecture and related problems
From MaRDI portal
Publication:3298120
DOI10.26493/1855-3974.1860.a3dzbMath1444.05058arXiv1811.08363WikidataQ123366347 ScholiaQ123366347MaRDI QIDQ3298120
Jean Paul Zerafa, Giuseppe Mazzuoccolo
Publication date: 21 July 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.08363
cubic graph; oddness; perfect matching; Berge-Fulkerson conjecture; Fan-Raspaud conjecture; Petersen colouring
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
On the existence of graphs which can colour every regular graph, \(H\)-colorings for 4-regular graphs, Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering a cubic graph with perfect matchings
- Sparsely intersecting perfect matchings in cubic graphs
- Unique Fulkerson coloring of Petersen minor-free cubic graphs
- Exponentially many perfect matchings in cubic graphs
- Measures of edge-uncolorability of cubic graphs
- Treelike snarks
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Perfect matchings with restricted intersection in cubic graphs
- Matching theory
- Fulkerson's conjecture and circuit covers
- 2-factor Hamiltonian graphs.
- Projective, affine, and abelian colorings of cubic graphs
- A remark on Petersen coloring conjecture of Jaeger
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- Petersen Cores and the Oddness of Cubic Graphs
- Petersen-colorings and some families of snarks
- Three matching intersection property for matching covered graphs
- 1‐Factor and Cycle Covers of Cubic Graphs
- On two consequences of Berge–Fulkerson conjecture
- S_12 and P_12-colorings of cubic graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Blocking and anti-blocking pairs of polyhedra
