Loading...
Loading...

Go to the content (press return)

Some results on the structure of multipoles in the study of snarks

Author
Fiol, M.; Vilaltella Castanyer, Joan
Type of activity
Journal article
Journal
Electronic journal of combinatorics
Date of publication
2015-02-25
Volume
22
Number
1
First page
1
Last page
20
Project funding
2009SGR1387
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/27888 Open in new window
URL
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p45 Open in new window
Abstract
Multipoles are the pieces we obtain by cutting some edges of a cubic graph in one or more points. As a result of the cut, a multipole M has vertices attached to a dangling edge with one free end, and isolated edges with two free ends. We refer to such free ends as semiedges, and to isolated edges as free edges. Every 3-edge-coloring of a multipole induces a coloring or state of its semiedges, which satisfies the Parity Lemma. Multipoles have been extensively used in the study of snarks, that is,...
Citation
Fiol, M.; Vilaltella Castanyer, Joan. Some results on the structure of multipoles in the study of snarks. "Electronic journal of combinatorics", 25 Febrer 2015, vol. 22, núm. 1, p. 1-20.
Keywords
GRAPHS, Parity Lemma, color closed, color complete, cubic graph, cycle, edge-coloring, irreducible, linear recurrence, multipole, separable, snark, states, tree
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants