{"id":"https://openalex.org/W4245527997","doi":"https://doi.org/10.1137/1.9781611973099.112","title":"List-Coloring Graphs without Subdivisions and without Immersions","display_name":"List-Coloring Graphs without Subdivisions and without Immersions","publication_year":2012,"publication_date":"2012-01-17","ids":{"openalex":"https://openalex.org/W4245527997","doi":"https://doi.org/10.1137/1.9781611973099.112"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973099.112","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.112","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.112","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.112","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ken-ichi Kawarabayashi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074548000","display_name":"Yusuke Kobayashi","orcid":"https://orcid.org/0000-0001-9478-7307"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yusuke Kobayashi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1425","last_page":"1435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9923999905586243,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9923999905586243,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9886999726295471,"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.953499972820282,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7776811122894287},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.7227405309677124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5625457167625427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5275898575782776},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.516992449760437},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5150718092918396},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.4420641362667084},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.4321001172065735},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4229365587234497},{"id":"https://openalex.org/keywords/graph-minor","display_name":"Graph minor","score":0.421385794878006},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.4206398129463196},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4101078510284424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3923507034778595},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3803032636642456},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.26965567469596863},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23071488738059998}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7776811122894287},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.7227405309677124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5625457167625427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5275898575782776},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.516992449760437},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5150718092918396},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.4420641362667084},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.4321001172065735},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4229365587234497},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.421385794878006},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.4206398129463196},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4101078510284424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3923507034778595},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3803032636642456},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.26965567469596863},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23071488738059998},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611973099.112","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.112","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.112","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.258","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.258","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012SODA/data/papers/352.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1137/1.9781611973099.112","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.112","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.112","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W398688634","https://openalex.org/W2380525562","https://openalex.org/W3169197204","https://openalex.org/W133702489","https://openalex.org/W4229747356","https://openalex.org/W4320918672","https://openalex.org/W4296859768","https://openalex.org/W4252904121","https://openalex.org/W1542397451"],"abstract_inverted_index":{"A":[0,29],"graph":[1,18,30,36,128,256,375],"G":[2,9,37],"contains":[3,10],"a":[4,11,17,35,69,89,92,100,103,117,177,211,258,292,357,361,387],"subdivision":[5,90,101,212,259],"of":[6,41,48,53,63,65,87,99,113,142,168,184,206,226,327,354,377,380,392],"H":[7,24,31,42,54],"if":[8,38],"subgraph":[12],"which":[13],"is":[14,32,315,341,383],"isomorphic":[15],"to":[16,45,57,108,120,147,200,302,318,345,368,386],"that":[19,71,96,149,313],"can":[20,82],"be":[21,83,109,121],"obtained":[22],"from":[23],"by":[25,153,275],"subdividing":[26],"some":[27],"edges.":[28],"immersed":[33],"in":[34,67,85,241,384],"the":[39,51,60,72,78,97,143,154,169,185,227,238,248,266,273,282,303],"vertices":[40,47,64],"are":[43,55,74,151,237,247,300],"mapped":[44,56],"(distinct)":[46],"G,":[49,66],"and":[50,91,102,116,124,137,179,230,271,278,307,338],"edges":[52],"paths":[58,73],"joining":[59],"corresponding":[61],"pairs":[62],"such":[68],"way":[70],"pairwise":[75],"edge-disjoint.":[76],"Although":[77],"well-known":[79],"Kuratowski's":[80],"theorem":[81],"stated":[84],"terms":[86],"both":[88],"minor,":[93],"we":[94,215],"know":[95],"notions":[98,112],"minor":[104,118],"do":[105],"not":[106],"seem":[107,119],"similar.":[110],"The":[111],"an":[114,193,218,233,262,320,347,370],"immersion":[115,155],"quite":[122],"similar,":[123],"structural":[125],"approach":[126],"concerning":[127,251,281],"minors":[129],"has":[130],"been":[131],"extremely":[132],"successful.":[133],"In":[134],"fact,":[135,214,245],"Robertson":[136],"Seymour":[138],"extended":[139],"their":[140],"proof":[141],"famous":[144,304],"Wanger's":[145],"conjecture":[146,306],"prove":[148],"graphs":[150,173,189,207,253,288,328,355,381,394],"well-quasi-ordered":[152],"relation.":[156],"We":[157,294,310],"give":[158,198,217],"additive":[159,201,219,283,371],"approximation":[160,202,220,284,372],"algorithms":[161,203],"for":[162,172,188,204,265,286,325,352,374,390],"list-coloring":[163,252,287],"within":[164,180,222],"3.5(k":[165],"+":[166,224],"1)":[167,183,225],"list-chromatic":[170,186],"number":[171,187],"without":[174,190,208,254,289,356,360],"Kk":[175,191,209,231,290],"as":[176,192,210,232,257,261,291],"subdivision,":[178],"1.5(k":[181],"\u2212":[182,335],"immersion.":[194],"Clearly":[195],"our":[196,298],"results":[197,240,250,299],"rise":[199],"graph-coloring":[205,326,353,391],"(in":[213,244],"shall":[216],"algorithm":[221,285,324,351,373,389],"2.5(k":[223],"chromatic":[228],"number)":[229],"immersion,":[234,263],"too.":[235],"These":[236],"first":[239,249],"this":[242],"direction":[243],"these":[246,378],"fixed":[255],"or":[260,359],"except":[264],"known":[267],"upper":[268],"bound":[269],"results)":[270],"extend":[272],"result":[274],"Kawarabayashi,":[276],"Demaine":[277],"Hajiaghayi":[279],"(SODA'09)":[280],"minor.":[293],"also":[295,342],"discuss":[296],"how":[297],"related":[301],"H\u00e1jos\u2019":[305],"Hadwiger's":[308],"conjecture.":[309],"point":[311],"out":[312],"it":[314,340,364],"Unique-Game":[316,343],"hard":[317,344],"obtain":[319,346],"O(k/":[321,348],"log2":[322,349],"k)-approximation":[323,350],"with":[329],"maximum":[330],"degree":[331],"at":[332],"most":[333],"k":[334],"2":[336],"[6],":[337],"hence":[339],"Kk-subdivision":[358],"Kk-immersion.":[362],"Therefore":[363],"really":[365],"makes":[366],"sense":[367],"consider":[369],"coloring":[376],"family":[379],"(which":[382],"contrast":[385],"2-approximation":[388],"H-minor-free":[393],"[13]).":[395]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}