( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bounding the fractional chromatic number of KΔ-free graphs

, и . CoRR, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jeffrey Edwards

Christopher Edwards

James Edwards

Oliver Edwards

Elisabeth Edwards

 

Другие публикации лиц с тем же именем

Half-integral linkages in highly connected directed graphs., , и . CoRR, (2016)Half-Integral Linkages in Highly Connected Directed Graphs., , и . ESA, том 87 из LIPIcs, стр. 36:1-36:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fast approximation algorithms for $p$-centres in large $δ$-hyperbolic graphs., , и . CoRR, (2016)Three-edge-colouring doublecross cubic graphs., , , и . J. Comb. Theory B, (2016)Bounding the Fractional Chromatic Number of KDelta-Free Graphs., и . SIAM J. Discret. Math., 27 (2): 1184-1208 (2013)Bounding the fractional chromatic number of KΔ-free graphs, и . CoRR, (2012)Fast Approximation Algorithms for p-centers in Large δ -hyperbolic Graphs., , и . WAW, том 10088 из Lecture Notes in Computer Science, стр. 60-73. (2016)Edge-colouring eight-regular planar graphs, , и . CoRR, (2012)A validation study of an Italian version of the brief pain inventory (Breve questionario per la valutazione del dolore), , , , , , , , , и . Pain, (xx xx 1996)10.1016/0304-3959(95)00156-5.Partial Interval Set Cover - Trade-Offs between Scalability and Optimality., , и . APPROX-RANDOM, том 8096 из Lecture Notes in Computer Science, стр. 110-125. Springer, (2013)