Show simple item record

dc.contributor.authorRies, Bernard
dc.date.accessioned2011-04-22T14:05:04Z
dc.date.available2011-04-22T14:05:04Z
dc.date.issued2010
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/6028
dc.language.isoenen
dc.subjectMixed graph coloringen
dc.subjectList coloringen
dc.subjectBipartite graphen
dc.subjectSchedulingen
dc.subjectComputational complexityen
dc.subject.ddc511en
dc.titleComplexity of two coloring problems in cubic planar bipartite mixed graphsen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherDIMAP - University of Warwick;Royaume-Uni
dc.description.abstractenIn this note we consider previous termtwo coloring problemsnext term in previous termmixed graphs, i.e., graphsnext term containing edges and arcs, which arise from scheduling previous termproblemsnext term where disjunctive and precedence constraints have to be taken into account. We show that they are both View the MathML source-complete in previous termcubic planar bipartite mixed graphs,next term which strengthens some results of Ries and de Werra (2008) [9].en
dc.relation.isversionofjnlnameDiscrete Applied Mathematics
dc.relation.isversionofjnlvol158en
dc.relation.isversionofjnlissue5en
dc.relation.isversionofjnldate2010
dc.relation.isversionofjnlpages592-596en
dc.relation.isversionofdoihttp://dx.doi.org/10.1016/j.dam.2009.10.016en
dc.description.sponsorshipprivatenonen
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelPrincipes généraux des mathématiquesen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record