2026-04-13T06:46:41Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/767802025-07-17T14:33:49Zcom_2072_1033col_2072_452950

c-Critical graphs with maximum degree three Fiol Mora, Miquel Àngel Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta Combinatorial analysis Graph Edge-coloring Chromatic index Conflicting vertex Edge-coloring degree c-Critical graph Configuracions i dissenys combinatoris 05B Designs and configurations 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$. Peer Reviewed Postprint (author’s final draft) 1995 Part of book or chapter of book 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. 0-471-30439-5 https://hdl.handle.net/2117/76780 eng http://eu.wiley.com/ http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Restricted access - publisher's policy 9 p. application/pdf John Wiley and Sons, Inc.