Mostra el registre d'ítem simple

dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.authorVilaltella Castanyer, Joan
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2015-05-12T10:08:14Z
dc.date.available2015-05-12T10:08:14Z
dc.date.created2015-02-25
dc.date.issued2015-02-25
dc.identifier.citationFiol, 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.
dc.identifier.issn1077-8926
dc.identifier.urihttp://hdl.handle.net/2117/27888
dc.description.abstractMultipoles 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, cubic graphs which are not 3-edge-colorable. Some results on the states and structure of the so-called color complete and color closed multipoles are presented. In particular, we give lower and upper linear bounds on the minimum order of a color complete multipole, and compute its exact number of states. Given two multipoles M1 and M2 with the same number of semiedges, we say that M1 is reducible to M2 if the state set of M2 is a non-empty subset of the state set of M1 and M2 has less vertices than M1. The function v(m) is defined as the maximum number of vertices of an irreducible multipole with rn semiedges. The exact values of v(m) are only known for m <= 5. We prove that tree and cycle multipoles are irreducible and, as a byproduct, that v(m) has a linear lower bound.
dc.format.extent20 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.lcshGraph theory
dc.subject.othercubic graph
dc.subject.otheredge-coloring
dc.subject.othersnark
dc.subject.othermultipole
dc.subject.otherParity Lemma
dc.subject.otherstates
dc.subject.othercolor complete
dc.subject.othercolor closed
dc.subject.otherseparable
dc.subject.otherirreducible
dc.subject.othertree
dc.subject.othercycle
dc.subject.otherlinear recurrence
dc.subject.otherGRAPHS
dc.titleSome results on the structure of multipoles in the study of snarks
dc.typeArticle
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.description.peerreviewedPeer Reviewed
dc.subject.ams05C Graph theory
dc.relation.publisherversionhttp://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p45
dc.rights.accessOpen Access
local.identifier.drac15451653
dc.description.versionPostprint (published version)
local.citation.authorFiol, M.; Vilaltella Castanyer, Joan
local.citation.publicationNameElectronic journal of combinatorics
local.citation.volume22
local.citation.number1
local.citation.startingPage1
local.citation.endingPage20


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple