Graph choosability and double list colorability

Article

creativeworkseries.issn	1232-9274
dc.contributor.author	Fanaï, Hamid-Reza
dc.date.available	2017-09-28T06:46:23Z
dc.date.issued	2010
dc.description.abstract	In this paper, we give a sufficient condition for graph choosability, based on Combinatorial Nullstellensatz and a specific property, called »double list colorability«, which means that there is a list assignment for which there are exactly two admissible colorings.	en
dc.description.version	wersja wydawnicza
dc.identifier.doi	http://dx.doi.org/10.7494/OpMath.2010.30.3.271
dc.identifier.eissn	2300-6919
dc.identifier.issn	1232-9274
dc.identifier.nukat	dd2011317137
dc.identifier.uri	https://repo.agh.edu.pl/handle/AGH/50123
dc.language.iso	eng
dc.relation.ispartof	Opuscula Mathematica
dc.rights	Attribution 4.0 International
dc.rights.access	otwarty dostęp
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/legalcode
dc.subject	list coloring	en
dc.subject	choosability	en
dc.title	Graph choosability and double list colorability	en
dc.title.related	Opuscula Mathematica
dc.type	artykuł
dspace.entity.type	Publication
publicationissue.issueNumber	No. 3
publicationissue.pagination	pp. 271-276
publicationvolume.volumeNumber	Vol. 30
relation.isJournalIssueOfPublication	38368edf-b287-4255-9bce-fe033d346afa
relation.isJournalIssueOfPublication.latestForDiscovery	38368edf-b287-4255-9bce-fe033d346afa
relation.isJournalOfPublication	304b3b9b-59b9-4830-9178-93a77e6afbc7

Files

Now showing 1 - 1 of 1