NP completeness of the edge precoloring extension problem on bipartite graphs

By Jirí Fiala. 2003

71 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/654886416a7ef1e38b0142b805b5ae29f5f42ce2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. András Gyárfás
2. Gábor Simony

In Discrete Mathematics and Combinatorics

1. András Gyárfás
2. Gábor Simony

Citations in the corpus

• Edge colorings of complete graphs without tricolored triangles (2004, result): “χc(D) is equal to the infimum of all real numbers p ≥ 1 for which there exists a weak circular p-coloring of D. The results of [ 7 ] show that this infimum is always attained; i.e., every digraph D admits a weak circular χc(D)-coloring.”