Normal 5-edge-coloring of some snarks superpositioned by flower snarks
From MaRDI portal
Publication:6612307
DOI10.1016/J.EJC.2024.104038zbMATH Open1548.05136MaRDI QIDQ6612307
Jelena Sedlar, Riste Škrekovski
Publication date: 30 September 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Measures of edge-uncolorability of cubic graphs
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
- A cyclically 6-edge-connected snark of order 118
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- Snarks without small cycles
- Berge-Fulkerson coloring for some families of superposition snarks
- Superposition of snarks revisited
- Variations on the Petersen colouring conjecture
- Normal 6-edge-colorings of some bridgeless cubic graphs
- A remark on the Petersen coloring conjecture of Jaeger
- New approach to Petersen coloring
- Petersen-colorings and some families of snarks
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Decompositions and reductions of snarks
- Normal 5-edge-colorings of a family of Loupekhine snarks
- Normal edge‐colorings of cubic graphs
- Network-Colourings
- Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
This page was built for publication: Normal 5-edge-coloring of some snarks superpositioned by flower snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612307)
