Mostra el registre d'ítem simple
c-Critical graphs with maximum degree three
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2015-09-15T08:25:28Z |
dc.date.created | 1995 |
dc.date.issued | 1995 |
dc.identifier.citation | Fiol, 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.isbn | 0-471-30439-5 |
dc.identifier.uri | http://hdl.handle.net/2117/76780 |
dc.description.abstract | Let $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.extent | 9 p. |
dc.language.iso | eng |
dc.publisher | John Wiley and Sons, Inc. |
dc.rights.uri | http://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.lcsh | Combinatorial analysis |
dc.subject.other | Graph |
dc.subject.other | Edge-coloring |
dc.subject.other | Chromatic index |
dc.subject.other | Conflicting vertex |
dc.subject.other | Edge-coloring degree |
dc.subject.other | c-Critical graph |
dc.title | c-Critical graphs with maximum degree three |
dc.type | Part of book or chapter of book |
dc.subject.lemac | Configuracions i dissenys combinatoris |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | 05B Designs and configurations |
dc.relation.publisherversion | http://eu.wiley.com/ |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 16886480 |
dc.description.version | Postprint (author’s final draft) |
dc.date.lift | 10000-01-01 |
local.citation.author | Fiol, M. |
local.citation.pubplace | New York |
local.citation.publicationName | Graph Theory, Combinatorics, and Applications |
local.citation.startingPage | 403 |
local.citation.endingPage | 411 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Capítols de llibre [200]
-
Capítols de llibre [22]