Number of the records: 1  

Coloring graphs from lists with bounded size of their union

  1. 1.
    SYSNO0027497
    TitleColoring graphs from lists with bounded size of their union
    TitleBarvení grafů z listů s omezeným sjednocením
    Author(s) Král´, D. (CZ)
    Sgall, Jiří (MU-W) RID, ORCID, SAI
    Source Title Journal of Graph Theory. Roč. 49, č. 3 (2005), s. 177-186. - : Wiley
    Document TypeČlánek v odborném periodiku
    Grant GA201/01/1195 GA ČR - Czech Science Foundation (CSF), CZ - Czech Republic
    LN00A056 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryUS
    Keywords graph coloring * list coloring
    Permanent Linkhttp://hdl.handle.net/11104/0117596
    FileDownloadSizeCommentaryVersionAccess
    Sgall1.pdf1105.4 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.