Name
Abstract | ||
|---|---|---|
A snark is a connected, bridgeless cubic graph with chromatic index equal to 4. The Berge–Fulkerson conjecture proposed in 1971 states that every bridgeless cubic graph contains a family of six perfect matchings such that each edge is contained in exactly two of them. This conjecture holds trivialy for 3-edge colorable graphs. Thus a possible minimum counterexample for the conjecture is a snark. In this paper we shown that the conjecture holds for families of snarks such as Loupekhine snarks of first and second kind and the Watkins snark. We also determine the excessive index for Loupekhine snarks of first and second kind. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11786-015-0227-z | Mathematics in Computer Science |
Keywords | Field | DocType |
Matching, Perfect matching, Snark, Berge-Fulkerson conjecture, Excessive Index | Edge coloring,Graph,Discrete mathematics,Combinatorics,Cubic graph,Matching (graph theory),Counterexample,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
9 | 2 | 1661-8270 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Manuel | 1 | 221 | 17.42 |
| A. S. Shanthi | 2 | 0 | 0.34 |