• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Complexity of two coloring problems in cubic planar bipartite mixed graphs

Thumbnail
Date
2010
Dewey
Principes généraux des mathématiques
Sujet
Mixed graph coloring; List coloring; Bipartite graph; Scheduling; Computational complexity
Journal issue
Discrete Applied Mathematics
Volume
158
Number
5
Publication date
2010
Article pages
592-596
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.dam.2009.10.016
URI
https://basepub.dauphine.fr/handle/123456789/6028
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Ries, Bernard
Type
Article accepté pour publication ou publié
Abstract (EN)
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].

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.