On two consequences of Berge-Fulkerson conjecture

05/17/2018
by   Vahan V. Mkrtchyan, et al.
0

The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph G admits a list of six perfect matchings such that each edge of G belongs to two of the perfect matchings from the list. In this short note, we discuss two statements that are consequences of this conjecture. We show that the first statement is equivalent to Fan-Raspaud conjecture. We also show that the smallest counter-example to the second one is a cyclically 4-edge-connected cubic graph.

READ FULL TEXT

page 1

page 2

page 3

research
07/21/2018

S_12 and P_12-colorings of cubic graphs

If G and H are two cubic graphs, then an H-coloring of G is a proper edg...
research
10/24/2019

A Note on Colourings of Connected 2-edge Coloured Cubic Graphs

In this short note we show that every connected 2-edge coloured cubic gr...
research
11/19/2021

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, a...
research
03/13/2019

Normal 6-edge-colorings of some bridgeless cubic graphs

In an edge-coloring of a cubic graph, an edge is poor or rich, if the se...
research
07/26/2022

Recent insights on the Uniqueness Problem of Diffeomorphisms determined by Prescribed Jacobian Determinant and Curl

Variational Principle (VP) forms diffeomorphisms with prescribed Jacobia...
research
12/21/2017

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44

The family of snarks -- connected bridgeless cubic graphs that cannot be...
research
03/19/2021

On a recolouring version of Hadwiger's conjecture

We prove that for any ε>0, for any large enough t, there is a graph G th...

Please sign up or login with your details

Forgot password? Click here to reset