Show simple item record

dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2015-09-15T08:25:28Z
dc.date.created1995
dc.date.issued1995
dc.identifier.citationFiol, M. c-Critical graphs with maximum degree three. A: "Graph Theory, Combinatorics, and Applications". New York: John Wiley and Sons, Inc., 1995, p. 403-411.
dc.identifier.isbn0-471-30439-5
dc.identifier.urihttp://hdl.handle.net/2117/76780
dc.description.abstractLet $G$ be a (simple) gtoph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident to it have the same color. The minimum possible number of conflicting vertices that a 3- edge-coloring of G can have is called the edge-coloring degree, $d(G)$, of $G$. Here we are mainly interested in the structure of a graph $G$ with given edge-coloring degree and, in particula.r, when G is c-critical, that is $d(G) = c \ge 1$ and $d(G - e) < c$ for any edge $e$ of $G$.
dc.format.extent9 p.
dc.language.isoeng
dc.publisherJohn Wiley and Sons, Inc.
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta
dc.subject.lcshCombinatorial analysis
dc.subject.othergraph
dc.subject.otheredge-coloring
dc.subject.otherchromatic index
dc.subject.otherconflicting vertex
dc.subject.otheredge-coloring degree
dc.subject.otherc-critical graph
dc.titlec-Critical graphs with maximum degree three
dc.typePart of book or chapter of book
dc.subject.lemacConfiguracions i dissenys combinatoris
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.description.peerreviewedPeer Reviewed
dc.subject.ams05B Designs and configurations
dc.relation.publisherversionhttp://eu.wiley.com/
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac16886480
dc.description.versionPostprint (author’s final draft)
dc.date.lift10000-01-01
local.citation.authorFiol, M.
local.citation.pubplaceNew York
local.citation.publicationNameGraph Theory, Combinatorics, and Applications
local.citation.startingPage403
local.citation.endingPage411


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain