Recent Submissions

  • On list k-coloring convex bipartite graphs 

    Díaz Cort, Josep; Yasar Diner, Oznur; Serna Iglesias, María José; Serra Albó, Oriol (Springer, 2020)
    Conference report
    Restricted access - publisher's policy
    List k–Coloring (LI k-COL) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..., k}. The problem is known to be NP-hard ...
  • How to determine if a random graph with a fixed degree sequence has a giant component 

    Joos, Felix; Perarnau Llobet, Guillem; Rautenbach, Dieter; Reed, Bruce (Institute of Electrical and Electronics Engineers (IEEE), 2016)
    Conference report
    Open Access
    The traditional Erdos-Renyi model of a random network is of little use in modelling the type of complex networks which modern researchers study. In this graph, every pair of vertices is equally likely to be connected by ...