Publication:
On non 3-choosable bipartite graphs

Simple item page
dc.contributor.authorCharoenpanitseri W.
dc.contributor.authorPunnim N.
dc.contributor.authorUiyyasathian C.
dc.date.accessioned2021-04-05T03:32:44Z
dc.date.available2021-04-05T03:32:44Z
dc.date.issued2013
dc.date.issuedBE2556
dc.description.abstractIn 2003, Fitzpatrick and MacGillivray proved that every complete bipartite graph with fourteen vertices except K7,7 is 3-choosable and there is the unique 3-list assignment L up to renaming the colors such that K 7,7 is not L-colorable. We present our strategies which can be applied to obtain another proof of their result. These strategies are invented to claim a stronger result that every complete bipartite graph with fifteen vertices except K7,8 is 3-choosable. We also show all 3-list assignments L such that K7,8 is not L-colorable. © 2013 Springer-Verlag.
dc.format.mimetypeapplication/pdf
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8296 LNCS, (2013), p.42-56
dc.identifier.doi10.1007/978-3-642-45281-9_4
dc.identifier.issn3029743
dc.identifier.other2-s2.0-84893108183
dc.identifier.urihttps://hdl.handle.net/20.500.14740/6495
dc.rights.holderScopus
dc.subject.otherBipartite graphs
dc.subject.otherChoosability
dc.subject.otherComplete bipartite graphs
dc.subject.otherFitzpatrick
dc.subject.otherList coloring
dc.subject.otherGraph theory
dc.subject.otherComputational geometry
dc.titleOn non 3-choosable bipartite graphs
dc.typeConference Paper
dspace.entity.typePublication
swu.datasource.scopushttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84893108183&doi=10.1007%2f978-3-642-45281-9_4&partnerID=40&md5=969fcc9745438385f1e1b33804c4b2c2

Files

Collections

Scopus: Year 1983-2021