An exact algorithm for the generalized list T-coloring problem
Discrete Algorithms
Main Authors: | Konstanty Junosza-Szaniawski, Pawel Rzazewski |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2014-06-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2095/pdf |
Similar Items
-
List edge and list total colorings of planar graphs without non-induced 7-cycles
by: Aijun Dong, et al.
Published: (2013-03-01) -
List circular backbone colouring
by: Frederic Havet, et al.
Published: (2014-01-01) -
On neighbour-distinguishing colourings from lists
by: Mirko Horňák, et al.
Published: (2012-08-01) -
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
by: Yury Person, et al.
Published: (2011-05-01) -
On the tileability of polygons with colored dominoes
by: Chris Worman, et al.
Published: (2007-01-01)