TY - STD TI - Araujo J, Linhares Sales C, Sau I (2010) Weighted coloring on $$p_4$$-sparse graphs. In: 11es Journées Doctorales en Informatique et Réseaux (Sophia Antipolis, Mar 2010) ID - ref1 ER - TY - STD TI - Bondy JA, Murty USR (2008) Graph theory. Graduate texts in mathematics. Springer, Berlin ID - ref2 ER - TY - JOUR AU - Werra, D. AU - Demange, M. AU - Escoffier, B. AU - Monnot, J. AU - Paschos, V. T. PY - 2005 DA - 2005// TI - Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation JO - Lect Notes Comput Sci VL - 3341 ID - Werra2005 ER - TY - JOUR AU - Demange, M. AU - Werra, D. AU - Monnot, J. AU - Paschos, V. T. PY - 2002 DA - 2002// TI - Weighted node coloring: when stable sets are expensive JO - Lect Notes Comput Sci VL - 2573 UR - https://doi.org/10.1007/3-540-36379-3_11 DO - 10.1007/3-540-36379-3_11 ID - Demange2002 ER - TY - JOUR AU - Escoffier, B. AU - Monnot, J. AU - Paschos, V. T. PY - 2006 DA - 2006// TI - Weighted coloring: futher complexity and approximability results JO - Inf Process Lett VL - 97 UR - https://doi.org/10.1016/j.ipl.2005.09.013 DO - 10.1016/j.ipl.2005.09.013 ID - Escoffier2006 ER - TY - JOUR AU - Gravier, S. PY - 1996 DA - 1996// TI - A Hajós-like theorem for list coloring JO - Discret Math VL - 152 ID - Gravier1996 ER - TY - JOUR AU - Guan, D. AU - Zhu, X. PY - 1997 DA - 1997// TI - A coloring problem for weighted graphs JO - Inf Process Lett VL - 61 UR - https://doi.org/10.1016/S0020-0190(97)00002-1 DO - 10.1016/S0020-0190(97)00002-1 ID - Guan1997 ER - TY - JOUR AU - Hajós, G. PY - 1961 DA - 1961// TI - Uber eine konstruktion nicht n-farbbarer graphen JO - Wiss Z Martin Luther Univ Math-Natur Reihe VL - 10 ID - Hajós1961 ER - TY - JOUR AU - Hanson, D. AU - Robinson, G. C. AU - Toft, B. PY - 1986 DA - 1986// TI - Remarks on the graph colour theorem of Hajós JO - Cong Numer VL - 55 ID - Hanson1986 ER - TY - BOOK AU - Jensen, T. R. AU - Toft, B. PY - 1995 DA - 1995// TI - Graph coloring problems PB - Wiley-Interscience CY - New York ID - Jensen1995 ER - TY - STD TI - Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85–104 ID - ref11 ER - TY - JOUR AU - Kral, D. PY - 2004 DA - 2004// TI - Hajós’ theorem for list coloring JO - Discrete Math VL - 287 UR - https://doi.org/10.1016/j.disc.2004.07.001 DO - 10.1016/j.disc.2004.07.001 ID - Kral2004 ER - TY - STD TI - Mansfield A, Welsh D (1982) Some colouring problems and their complexity. In: Bollobás B (ed) Graph theory, proceedings of the conference on graph theory, vol 62 of North-Holland mathematics studies. North-Holland, pp 159–170 ID - ref13 ER - TY - JOUR AU - Mohar, B. PY - 2005 DA - 2005// TI - Hajós’ theorem for colorings of edge-weighted graphs JO - Combinatorica VL - 25 UR - https://doi.org/10.1007/s00493-005-0005-7 DO - 10.1007/s00493-005-0005-7 ID - Mohar2005 ER - TY - BOOK AU - Ore, O. PY - 1967 DA - 1967// TI - The four color problem PB - Academic Press CY - New York ID - Ore1967 ER - TY - JOUR AU - Urquhart, A. PY - 1997 DA - 1997// TI - The graph constructions of Hajós and Ore JO - J Graph Theory VL - 26 UR - https://doi.org/3.0.CO;2-T DO - 3.0.CO;2-T ID - Urquhart1997 ER - TY - JOUR AU - Zhu, X. PY - 2003 DA - 2003// TI - An analogue of Hajós’ theorem for the circular chromatic number (ii) JO - Graphs Comb VL - 19 UR - https://doi.org/10.1007/s00373-002-0505-9 DO - 10.1007/s00373-002-0505-9 ID - Zhu2003 ER -