Concepedia

<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si5.gif" display="inline" overflow="scroll"><mml:mi>b</mml:mi></mml:math>-coloring of tight graphs

Frédéric Havet, Cláudia Linhares Sales, Leonardo Sampaio

Discrete Applied Mathematics · 2011 · 46 citations · 18 references

DOI

Concepts

References

18

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · SIAM Journal on Computing · 1973 · 2.8K citations

, , +13

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

An introduction to timetabling

D. de Werra · European Journal of Operational Research · 1985 · 573 citations · Full text

, , +6

Some lower bounds for a class of frequency assignment problems

Anthony Gamst · IEEE Transactions on Vehicular Technology · 1986 · 367 citations

, , +17

The priority-based coloring approach to register allocation

Fred Chow, John L. Hennessy · ACM Transactions on Programming Languages and Systems · 1990 · 333 citations · Full text

, , +22