scholarly journals Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs

2021 ◽  
Author(s):  
Khaled Elbassioni
Keyword(s):  
Polynomial Algorithms ◽  
List Coloring ◽  
Intersecting Hypergraphs

Exploring the complexity boundary between coloring and list-coloring

2006 ◽  
Vol 25 ◽  
pp. 41-47 ◽  
Author(s):  
Flavia Bonomo ◽  
Guillermo Durán ◽  
Javier Marenco
Keyword(s):  
List Coloring

scholarly journals 3-list-coloring planar graphs of girth 4

2011 ◽  
Vol 311 (6) ◽  
pp. 413-417 ◽  
Author(s):  
Jun-Lin Guo ◽  
Yue-Li Wang
Keyword(s):  
Planar Graphs ◽  
List Coloring

List Coloring of Two Matroids through Reduction to Partition Matroids

2021 ◽  
Vol 35 (3) ◽  
pp. 2192-2209
Author(s):  
Kristóf Bérczi ◽  
Tamás Schwarcz ◽  
Yutaro Yamaguchi
Keyword(s):  
List Coloring

scholarly journals Three-colourability and forbidden subgraphs. II: polynomial algorithms

2002 ◽  
Vol 251 (1-3) ◽  
pp. 137-153 ◽  
Author(s):  
Bert Randerath ◽  
Ingo Schiermeyer ◽  
Meike Tewes
Keyword(s):  
Polynomial Algorithms ◽  
Forbidden Subgraphs

scholarly journals Polynomial algorithms for open plane graph and subgraph isomorphisms

2013 ◽  
Vol 498 ◽  
pp. 76-99 ◽  
Author(s):  
Colin de la Higuera ◽  
Jean-Christophe Janodet ◽  
Émilie Samuel ◽  
Guillaume Damiand ◽  
Christine Solnon
Keyword(s):  
Plane Graph ◽  
Polynomial Algorithms ◽  
Open Plane
Sign in / Sign up

Export Citation Format

Share Document