Add to ORKGAbstract. We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs. Key words. computational complexity, NP-complete problems, chromatic index, edge-coloring 1. Introduction. Th
AbstractWe describe a simple characterization of graphs which are simultaneouly split and indifferen...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex c...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
14 p. : il.The class C of graphs that do not contain a cycle with a unique chord was recently studie...
AbstractThe class C of graphs that do not contain a cycle with a unique chord was recently studied b...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
AbstractThe chromatic index problem is known to be NP-complete, even for line graphs. In this paper ...
International audienceA proper $k$-edge-colouring $\phi$ of a graph $G$ is an assignment of colours ...
AbstractIt is well known that the problem of graph k-colourability, for any k≥3, is NP-complete but ...
In this paper it is proved that the problem of determining the total chromatic number of an arbitrar...
7 p. : il.An edge-coloring is an association of colors to the edges of a graph, in such a way that n...
International audienceAn undirected simple graph $G$ is locally irregular if adjacent vertices of $G...
This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select...
AbstractWe describe a simple characterization of graphs which are simultaneouly split and indifferen...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex c...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such th...
14 p. : il.The class C of graphs that do not contain a cycle with a unique chord was recently studie...
AbstractThe class C of graphs that do not contain a cycle with a unique chord was recently studied b...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
AbstractThe chromatic index problem is known to be NP-complete, even for line graphs. In this paper ...
International audienceA proper $k$-edge-colouring $\phi$ of a graph $G$ is an assignment of colours ...
AbstractIt is well known that the problem of graph k-colourability, for any k≥3, is NP-complete but ...
In this paper it is proved that the problem of determining the total chromatic number of an arbitrar...
7 p. : il.An edge-coloring is an association of colors to the edges of a graph, in such a way that n...
International audienceAn undirected simple graph $G$ is locally irregular if adjacent vertices of $G...
This thesis visits the forefront of algorithmic research on edge coloring of cubic graphs. We select...
AbstractWe describe a simple characterization of graphs which are simultaneouly split and indifferen...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex c...