Skip to main content
Log in

Berge–Fulkerson Coloring for Infinite Families of Snarks

  • Original Paper
  • Published:
Bulletin of the Iranian Mathematical Society Aims and scope Submit manuscript

Abstract

It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. Hägglund constructed Blowup\((K_4, C)\) and Blowup(Prism, \(C_4)\). Based on these two graphs, Chen constructed infinite families of bridgeless cubic graphs \(M_{0,1,2, \ldots ,k-2, k-1}\) which are obtained from cyclically 4-edge-connected and admitting Fulkerson-cover cubic graphs \(G_0,G_1,\ldots , G_{k-1}\) by recursive process. He obtained that every graph in \(M_{0,1,2,3}\) has a Fulkerson-cover and gave the open problem that whether every graph in \(M_{0,1,2, \ldots ,k-2, k-1}\) has a Fulkerson-cover. In this paper, we solve this problem and prove that every graph in \(M_{0,1,2, \ldots ,k-2, k-1}\) has a Fulkerson-cover.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abreu, M., Kaiser, T., Labbate, D., Mazzuoccolo, G.: Treelike snarks. Electron. J. Combin. 23(3), \(\#\)P3.54 (2016)

  2. Chen, F.: A note on Fouquet–Vanherpe’s question and Fulkerson conjecture. Bull. Iran. Math. Soc. 42(5), 1247–1258 (2016)

    MathSciNet  MATH  Google Scholar 

  3. Chen, F., Fan, G.: Fulkerson-covers of hypohamiltonian graphs. Discrete Appl. Math. 186, 66–73 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  4. Esperet, L., Mazzuoccolo, G.: On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings. J. Graph Theory 77(2), 144–157 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fan, G., Raspaud, A.: Fulkerson’s conjecture and circuit covers. J. Comb. Theory Ser. B. 61(1), 133–138 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fulkerson, D.R.: Blocking and anti-blocking pairs of polyhedra. Math. Program. 1(1), 168–194 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hägglund, J.: On snarks that are far from being 3-edge colorable. Electron. J. Comb. 23(2), 10 (2016)

    MathSciNet  MATH  Google Scholar 

  8. Hao, R.X., Niu, J.B., Wang, X.F., Zhang, C.-Q., Zhang, T.Y.: A note on Berge–Fulkerson coloring. Discrete Math. 309(13), 4235–4240 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Máčajová, E., Škoviera, M.: On a conjecture of Fan and Raspaud. Electron. Notes Discrete Math. 34, 237–241 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mazzuoccolo, G.: The equivalence of two conjectures of Berge and Fulkerson. J. Graph Theory 68(2), 125–128 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Seymour, P.D.: On multi-colourings of cubic graphs, and conjectures of Fulkerson and Tutte. Proc. Lond. Math. Soc. 38(3), 423–460 (1979)

    Article  MATH  Google Scholar 

  12. Zhang, C.-Q.: Integer Flows and Cycle Covers of Graphs. Marcel Dekker Inc, New York (1997)

    Google Scholar 

Download references

Acknowledgements

Many thanks to the anonymous referees for their helpful comments and suggestions. This work was supported by the NSFC (nos. 11371052,11171020), the Fundamental Research Funds for the Central Universities (nos. 2016JBM 071, 2016JBZ012), the 111 Project of China (B16002).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rong-Xia Hao.

Additional information

Communicated by Hossein Hajiabolhassan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zheng, T., Hao, RX. Berge–Fulkerson Coloring for Infinite Families of Snarks. Bull. Iran. Math. Soc. 44, 277–290 (2018). https://doi.org/10.1007/s41980-018-0019-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41980-018-0019-8

Keywords

Mathematics Subject Classification

Navigation