{"id":"https://openalex.org/W2132095827","doi":"https://doi.org/10.1137/060668675","title":"A New Algorithm for On-line Coloring Bipartite Graphs","display_name":"A New Algorithm for On-line Coloring Bipartite Graphs","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2132095827","doi":"https://doi.org/10.1137/060668675","mag":"2132095827"},"language":"en","primary_location":{"id":"doi:10.1137/060668675","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060668675","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1548355","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hajo J. Broersma","raw_affiliation_strings":["Discrete Mathematics and Mathematical Programming"],"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Mathematical Programming","institution_ids":["https://openalex.org/I2799411422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041916584","display_name":"Agostino Capponi","orcid":"https://orcid.org/0000-0001-9735-7935"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Agostino Capponi","raw_affiliation_strings":["Durham University"],"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dani\u00ebl Paulusma","raw_affiliation_strings":["Discrete Mathematics and Mathematical Programming"],"affiliations":[{"raw_affiliation_string":"Discrete Mathematics and Mathematical Programming","institution_ids":["https://openalex.org/I2799411422"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068613759"],"corresponding_institution_ids":["https://openalex.org/I2799411422"],"apc_list":null,"apc_paid":null,"fwci":1.1552,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.8239993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"22","issue":"1","first_page":"72","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.996399998664856,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9775000214576721,"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/bipartite-graph","display_name":"Bipartite graph","score":0.905381441116333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8601194620132446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7385510206222534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.501046895980835},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4744718670845032},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.45676398277282715},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.44996777176856995},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4283081293106079},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.42478734254837036},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3436376452445984},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33021023869514465},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3269208073616028},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.16645696759223938}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.905381441116333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8601194620132446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7385510206222534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.501046895980835},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4744718670845032},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.45676398277282715},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.44996777176856995},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4283081293106079},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.42478734254837036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3436376452445984},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33021023869514465},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3269208073616028},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.16645696759223938},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/060668675","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060668675","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/e0f152c0-733c-4d56-9a2f-9144d2805125","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/e0f152c0-733c-4d56-9a2f-9144d2805125","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Broersma, H J, Capponi, A & Paulusma, D 2008, 'A new algorithm for on-line coloring bipartite graphs', SIAM journal on discrete mathematics, vol. 22, no. 1, pp. 72-91. https://doi.org/10.1137/060668675","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:7433","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/7433/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 2008, Vol.22(1), pp.72-91 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:authors.library.caltech.edu:10098","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/10098/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1548355","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1548355","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1548355","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1548355","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1488681147","https://openalex.org/W1512794094","https://openalex.org/W1552828154","https://openalex.org/W1987042917","https://openalex.org/W1988407539","https://openalex.org/W2005668212","https://openalex.org/W2033961412","https://openalex.org/W2041645394","https://openalex.org/W2047840455","https://openalex.org/W2087978044","https://openalex.org/W2089191641","https://openalex.org/W2094108224","https://openalex.org/W2130271612","https://openalex.org/W2166858292","https://openalex.org/W2170823181","https://openalex.org/W2178802647","https://openalex.org/W2549673476"],"related_works":["https://openalex.org/W2380525562","https://openalex.org/W2163432100","https://openalex.org/W4291316360","https://openalex.org/W1542397451","https://openalex.org/W3169197204","https://openalex.org/W4229747356","https://openalex.org/W4311345810","https://openalex.org/W2152008865","https://openalex.org/W4296859768","https://openalex.org/W3187209459"],"abstract_inverted_index":{"We":[0,27,57],"first":[1],"show":[2],"that":[3,59,70,114],"for":[4,20,36,49,65,89,129],"any":[5,138],"bipartite":[6,25,38,55,67,93,126],"graph":[7],"H":[8],"with":[9],"at":[10],"most":[11],"five":[12],"vertices":[13],"there":[14,115],"exists":[15,116],"an":[16,33,74],"on-line":[17,34,51,63,87,106,119],"competitive":[18,64,118],"algorithm":[19,35,44,61,88,120],"the":[21,30,50,60,86,105,131,143],"class":[22],"of":[23,32,54,82,133],"H-free":[24],"graphs.":[26,56],"then":[28],"analyze":[29],"performance":[31],"coloring":[37],"graphs":[39,94],"on":[40,77,142],"various":[41],"subfamilies.":[42],"The":[43,80],"yields":[45],"new":[46],"upper":[47],"bounds":[48],"chromatic":[52,107,144],"number":[53,81,132],"prove":[58],"is":[62,112,135],"$P_7$-free":[66,92],"graphs,":[68,127],"i.e.,":[69,128],"do":[71],"not":[72],"contain":[73],"induced":[75],"path":[76],"seven":[78],"vertices.":[79],"colors":[83,134],"used":[84],"by":[85,98,137],"$P_6$-free":[90,123],"and":[91,101],"is,":[95],"respectively,":[96],"bounded":[97,136],"roughly":[99,102],"twice":[100],"eight":[103],"times":[104],"number.":[108,145],"In":[109],"contrast,":[110],"it":[111],"known":[113],"no":[117],"to":[121],"color":[122],"(or":[124],"$P_7$-free)":[125],"which":[130],"function":[139],"depending":[140],"only":[141]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}