AbstractIn the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In this paper, we will prove that this problem is NP-complete even in a very restricted setting. Also, a closely related problem, namely the maximum antimatching problem, is studied, and some NP-completeness results and a polynomial time algorithm for a subproblem are derived
International audienceIn this paper we study a generalization of both proper edge-coloring and stron...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
In the strong edge coloring problem, the objective is to color the edges of the given graph with the...
AbstractIn the strong edge coloring problem, the objective is to color the edges of the given graph ...
International audienceA strong edge-colouring of a graph G is a proper edge-colouring such that ever...
International audienceA strong edge colouring of a graph $G$ is a proper edge colouring such that ev...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractA matching M in a graph is called induced if there is no edge in the graph connecting two ed...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractIn 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is b...
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. T...
A proper edge coloring c of a graph G is called a k-strong edge coloring, if for every two distinct...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
grantor: University of TorontoA strong edge-colouring of a graph 'G' is an assignment of c...
International audienceIn this paper we study a generalization of both proper edge-coloring and stron...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
In the strong edge coloring problem, the objective is to color the edges of the given graph with the...
AbstractIn the strong edge coloring problem, the objective is to color the edges of the given graph ...
International audienceA strong edge-colouring of a graph G is a proper edge-colouring such that ever...
International audienceA strong edge colouring of a graph $G$ is a proper edge colouring such that ev...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractA matching M in a graph is called induced if there is no edge in the graph connecting two ed...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractIn 1985, Erdős and Neśetril conjectured that the strong edge-coloring number of a graph is b...
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. T...
A proper edge coloring c of a graph G is called a k-strong edge coloring, if for every two distinct...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
grantor: University of TorontoA strong edge-colouring of a graph 'G' is an assignment of c...
International audienceIn this paper we study a generalization of both proper edge-coloring and stron...
We show that the following fundamental edge-colouring problem can be solved in polynomial time for a...
AbstractIt is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at ...
DOI
Add to ORKG