{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:06Z","timestamp":1725815946146},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_1","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Arguments in Graph Coloring (Invited Talk)"],"prefix":"10.1007","author":[{"given":"C. R.","family":"Subramanian","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548300000122","volume":"1","author":"N. Alon","year":"1992","unstructured":"Alon, N.: Choice numbers of graphs: A probabilistic approach. Combinatorics, Probability and Computing\u00a01(2), 107\u2013114 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics\u00a014(3), 390\u2013408 (1973)","journal-title":"Israel Journal of Mathematics"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"J. Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotically good list-colorings. Journal of Combinatorial Theory, Series A\u00a073(1), 1\u201359 (1996)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S0963548300001528","volume":"4","author":"J.H. Kim","year":"1995","unstructured":"Kim, J.H.: On brooks\u2019 theorem for sparse graphs. Combinatorics, Probability and Computing\u00a04(2), 97\u2013132 (1995)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1999.1910","volume":"77","author":"N. Alon","year":"1999","unstructured":"Alon, N., Krivelevich, M., Sudakov, B.: Colouring graphs with sparse neighborhoods. Journal of Combinatorial Theory, Series B\u00a077(1), 73\u201382 (1999)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"1_CR6","unstructured":"Erd\u00f6s, P., Lovasz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sos, V.T. (eds.) Infinite and Finite Series, pp. 609\u2013628 (1975)"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1991","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Structures and Algorithms\u00a02(3), 277\u2013288 (1991)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF01195001","volume":"17","author":"H. Hind","year":"1997","unstructured":"Hind, H., Molloy, M., Reed, B.: Colouring a graph frugally. Combinatorica\u00a017(4), 469\u2013482 (1997)","journal-title":"Combinatorica"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1137\/S0097539795294578","volume":"28","author":"H. Hind","year":"1998","unstructured":"Hind, H., Molloy, M., Reed, B.: Total coloring with \u0394\u2009+\u2009poly(log\u0394) colors. SIAM Journal on Computing\u00a028(3), 816\u2013821 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"23","key":"1_CR10","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.disc.2007.03.006","volume":"307","author":"R. Muthu","year":"2007","unstructured":"Muthu, R., Narayanan, N., Subramanian, C.R.: Improved bounds on acylic edge colouring. Discrete Mathematics\u00a0307(23), 3063\u20133069 (2007)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.7151\/dmgt.1456","volume":"29","author":"R. Muthu","year":"2009","unstructured":"Muthu, R., Narayanan, N., Subramanian, C.R.: On k-intersection edge colourings. Discussiones Mathematicae Graph Theory\u00a029(2), 411\u2013418 (2009)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-70575-8_26","volume-title":"Automata, Languages and Programming","author":"S. Pemmaraju","year":"2008","unstructured":"Pemmaraju, S., Srinivasan, A.: The randomized coloring procedure with symmetry-breaking. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 306\u2013319. Springer, Heidelberg (2008)"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s00373-005-0635-y","volume":"21","author":"C. Greenhill","year":"2005","unstructured":"Greenhill, C., Pikhurko, O.: Bounds on the generalized acylic chromatic numbers of bounded degree graphs. Graphs and Combinatorics\u00a021(4), 407\u2013419 (2005)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/jgt.20029","volume":"47","author":"G. Fertin","year":"2004","unstructured":"Fertin, G., Raspaud, A., Reed, B.: Star coloring of graphs. Journal of Graph Theory\u00a047(3), 163\u2013182 (2004)","journal-title":"Journal of Graph Theory"},{"key":"1_CR15","volume-title":"Graph Colouring and the Probabilistic Method","author":"M. Molly","year":"2000","unstructured":"Molly, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Germany (2000)"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P","volume":"24","author":"A.V. Kostochka","year":"1997","unstructured":"Kostochka, A.V., Sopena, E., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. Journal of Graph Theory\u00a024(4), 331\u2013340 (1997)","journal-title":"Journal of Graph Theory"},{"key":"1_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. John Wiley & Sons, Inc., New York (2008)","edition":"3"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S0963548306007735","volume":"16","author":"C.R. Subramanian","year":"2007","unstructured":"Subramanian, C.R.: List set coloring: bounds and algorithms. Combinatorics, Probability and Computing\u00a016(1), 145\u2013158 (2007)","journal-title":"Combinatorics, Probability and Computing"},{"key":"1_CR19","unstructured":"Subramanian, C.R.: List hereditary colorings. In: Proceedings of the 2nd International Conference on Discrete Mathematics (ICDM), India, June 6-10. RMS Lecture Note Series, vol.\u00a013, pp. 191\u2013205. Ramanujan Mathematical Society (2010)"},{"key":"1_CR20","unstructured":"Subramanian, C.R.: List hereditary colorings of graphs and hypergraphs (2014) (manuscript)"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/080733917","volume":"24","author":"N.R. Aravind","year":"2010","unstructured":"Aravind, N.R., Subramanian, C.R.: Bounds on edge colorings with restrictions on the union of color classes. SIAM Journal of Discrete Mathematics\u00a024(3), 841\u2013852 (2010)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/jgt.20501","volume":"66","author":"N.R. Aravind","year":"2011","unstructured":"Aravind, N.R., Subramanian, C.R.: Bounds on vertex colorings with restrictions on the union of color classes. Journal of Graph Theory\u00a066(3), 213\u2013234 (2011)","journal-title":"Journal of Graph Theory"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ejc.2011.09.045","volume":"34","author":"N.R. Aravind","year":"2013","unstructured":"Aravind, N.R., Subramanian, C.R.: Forbidden subgraph colorings and the oriented chromatic number. European Journal of Combinatorics\u00a034, 620\u2013631 (2013)","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jctb.2002.2110","volume":"86","author":"B. Reed","year":"2002","unstructured":"Reed, B., Sudakov, B.: Asymptotically the list colouring constants are 1. Journal of Combinatorial Theory, Series B\u00a086(1), 27\u201337 (2002)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jgt.1010","volume":"37","author":"N. Alon","year":"2001","unstructured":"Alon, N., Sudakov, B., Zaks, A.: Acylic edge colorings of graphs. Journal of Graph Theory\u00a037(3), 157\u2013167 (2001)","journal-title":"Journal of Graph Theory"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/050639879","volume":"29","author":"A. Gebremedhin","year":"2007","unstructured":"Gebremedhin, A., Tarafdar, A., Manne, F., Pothen, A.: New acyclic and star coloring algorithms with applications to Hessian computation. SIAM Journal on Scientific Computing\u00a029, 1042\u20131072 (2007)","journal-title":"SIAM Journal on Scientific Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:17:04Z","timestamp":1559092624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}