{"id":"https://openalex.org/W1989513471","doi":"https://doi.org/10.1017/s0963548309009973","title":"Efficient Graph Packing via Game Colouring","display_name":"Efficient Graph Packing via Game Colouring","publication_year":2009,"publication_date":"2009-05-21","ids":{"openalex":"https://openalex.org/W1989513471","doi":"https://doi.org/10.1017/s0963548309009973","mag":"1989513471"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548309009973","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309009973","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111882184","display_name":"H. A. Kierstead","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. A. KIERSTEAD","raw_affiliation_strings":["Department of Mathematics and Statistics, Arizona State University, Tempe, AZ 85287, USA (e-mail:","Department of mathematics and statistics, arizona state university, tempe, az 85287, usa (e-mail: kierstead@asu.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Arizona State University, Tempe, AZ 85287, USA (e-mail:","institution_ids":["https://openalex.org/I55732556"]},{"raw_affiliation_string":"Department of mathematics and statistics, arizona state university, tempe, az 85287, usa (e-mail: kierstead@asu.edu)","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080894223","display_name":"Alexandr Kostochka","orcid":"https://orcid.org/0000-0002-6363-3804"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. V. KOSTOCHKA","raw_affiliation_strings":["Department of Mathematics, University of Illinois, Urbana, IL 61801, USA and Institute of Mathematics, Novosibirsk, Russia (e-mail:","Department of mathematics, university of illinois, urbana, il 61801, usa and institute of mathematics, novosibirsk, russia (e-mail: kostochk@math.uiuc.edu)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Illinois, Urbana, IL 61801, USA and Institute of Mathematics, Novosibirsk, Russia (e-mail:","institution_ids":["https://openalex.org/I183874917"]},{"raw_affiliation_string":"Department of mathematics, university of illinois, urbana, il 61801, usa and institute of mathematics, novosibirsk, russia (e-mail: kostochk@math.uiuc.edu)","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3887,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.80212783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"18","issue":"5","first_page":"765","last_page":"774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8037528395652771},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5920448303222656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5915628671646118},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5354568958282471},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.429451584815979},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3712112307548523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30095142126083374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11643120646476746}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8037528395652771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5920448303222656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5915628671646118},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5354568958282471},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.429451584815979},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3712112307548523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30095142126083374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11643120646476746}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548309009973","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309009973","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.6330","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.6330","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/%7Ekostochk/docs/2012/cpc09k.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W137844391","https://openalex.org/W1973674396","https://openalex.org/W1978747958","https://openalex.org/W1988939889","https://openalex.org/W1999552793","https://openalex.org/W2011338393","https://openalex.org/W2015832457","https://openalex.org/W2034163816","https://openalex.org/W2039027438","https://openalex.org/W2041300188","https://openalex.org/W2045411943","https://openalex.org/W2076873334","https://openalex.org/W2079690680","https://openalex.org/W2082497622","https://openalex.org/W2083586321","https://openalex.org/W2094108224","https://openalex.org/W2099957850","https://openalex.org/W2105137385","https://openalex.org/W2107628600","https://openalex.org/W2144293155","https://openalex.org/W2149573503","https://openalex.org/W2160743102","https://openalex.org/W2994106552","https://openalex.org/W4213136504","https://openalex.org/W4253150358","https://openalex.org/W6605667754","https://openalex.org/W6675886122"],"related_works":["https://openalex.org/W2081900870","https://openalex.org/W3111219495","https://openalex.org/W2183306018","https://openalex.org/W2549990292","https://openalex.org/W2345479200","https://openalex.org/W2951819827","https://openalex.org/W2849310602","https://openalex.org/W2980963558","https://openalex.org/W2419146053","https://openalex.org/W4301046126"],"abstract_inverted_index":{"The":[0],"game":[1],"colouring":[2,145],"number":[3],"gcol(":[4,54],"G":[5,10,55,59,70,73,80,83,98,104,115,118,121,124,130,133],")":[6,56,85,126],"of":[7,25,30,46,97,103,144],"a":[8,26,148],"graph":[9],"is":[11,94,140],"the":[12,23,49,101,141],"least":[13],"k":[14,40],"such":[15],"that,":[16],"if":[17,67,113],"two":[18,68],"players":[19],"take":[20],"turns":[21],"choosing":[22],"vertices":[24,77],"graph,":[27],"then":[28,88,129],"either":[29],"them":[31],"can":[32],"ensure":[33],"that":[34,66,112],"every":[35],"vertex":[36],"has":[37],"fewer":[38],"than":[39],"neighbours":[41],"chosen":[42],"before":[43],"it,":[44],"regardless":[45],"what":[47],"choices":[48],"other":[50],"player":[51],"makes.":[52],"Clearly":[53],"\u2264":[57],"\u0394(":[58],")+1.":[60],"Sauer":[61],"and":[62,72,132],"Spencer":[63],"[20]":[64],"proved":[65],"graphs":[69],"1":[71,81,99,116,125,131],"2":[74,84,105,119,122,134],"on":[75],"n":[76,87,128],"satisfy":[78],"2\u0394(":[79],")\u0394(":[82],"<":[86,127],"they":[89],"pack,":[90],"i.e":[91],".,":[92],"there":[93],"an":[95],"embedding":[96],"into":[100],"complement":[102],".":[106],"We":[107],"improve":[108],"this":[109,139],"by":[110],"showing":[111],"(gcol(":[114],")\u22121)\u0394(":[117,123],")+(gcol(":[120],"pack.":[135],"To":[136],"our":[137],"knowledge":[138],"first":[142],"application":[143],"games":[146],"to":[147],"non-game":[149],"problem.":[150]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}