Complexity of two coloring problems in cubic planar bipartite mixed graphs

dc.contributor.author	Ries, Bernard
dc.date.accessioned	2011-04-22T14:05:04Z
dc.date.available	2011-04-22T14:05:04Z
dc.date.issued	2010
dc.identifier.uri	https://basepub.dauphine.fr/handle/123456789/6028
dc.language.iso	en	en
dc.subject	Mixed graph coloring	en
dc.subject	List coloring	en
dc.subject	Bipartite graph	en
dc.subject	Scheduling	en
dc.subject	Computational complexity	en
dc.subject.ddc	511	en
dc.title	Complexity of two coloring problems in cubic planar bipartite mixed graphs	en
dc.type	Article accepté pour publication ou publié
dc.contributor.editoruniversityother	DIMAP - University of Warwick;Royaume-Uni
dc.description.abstracten	In 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.isversionofjnlname	Discrete Applied Mathematics
dc.relation.isversionofjnlvol	158	en
dc.relation.isversionofjnlissue	5	en
dc.relation.isversionofjnldate	2010
dc.relation.isversionofjnlpages	592-596	en
dc.relation.isversionofdoi	http://dx.doi.org/10.1016/j.dam.2009.10.016	en
dc.description.sponsorshipprivate	non	en
dc.relation.isversionofjnlpublisher	Elsevier	en
dc.subject.ddclabel	Principes généraux des mathématiques	en

Files in this item

Files	Size	Format	View
There are no files associated with this item.