• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 55 matches

• 2024
• 
  Israel R. Curbelo, Hannah R. Malko:
  On the on-line coloring of proper interval graphs. CoRR abs/2401.05648 (2024)
• 2023
• 
  Jamie Bishop, Rebekah Kuss, Benjamin Peet:
  Variations on Ramsey numbers and minimum numbers of monochromatic triangles in line $2$-colorings of configurations. Electron. J. Graph Theory Appl. 11(2): 431-445 (2023)
• 
  Ronen Wdowinski:
  Orientation-based edge-colorings and linear arboricity of multigraphs. J. Graph Theory 102(4): 633-647 (2023)
• 2022
• 
  Oliver Janzer, Zoltán Lóránt Nagy:
  Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz. Des. Codes Cryptogr. 90(9): 1991-2001 (2022)
• 
  Bartosz Bieganowski:
  On-line interval graphs coloring - Modification of the First-Fit algorithm and its performance ratio. Discret. Math. Algorithms Appl. 14(8): 2250042:1-2250042:7 (2022)
• 
  Roberto Montemanni, Xiaochen Chou, Derek H. Smith:
  Upper and lower bounds based on linear programming for the b-coloring problem. EURO J. Comput. Optim. 10: 100049 (2022)
• 
  Zdenek Dvorák, Daniel Král', Robin Thomas:
  Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory B 152: 483-504 (2022)
• 
  Arunav Gupta:
  Coloring Inside the Lines: The Jagged Legacy of the HOLC Neighborhood Risk Maps. CoRR abs/2212.04117 (2022)
• 2021
• 
  Ming Chen, Yusheng Li, Li Zhang:
  Linear list coloring of some sparse graph. Discuss. Math. Graph Theory 41(1): 51-64 (2021)
• 
  Hamid Reza Daneshpajouh, Frédéric Meunier, Guilhem Mizrahi:
  Colorings of complements of line graphs. J. Graph Theory 98(2): 216-233 (2021)
• 
  Amin Saberi, David Wajc:
  The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. ICALP 2021: 109:1-109:18
• 
  Amin Saberi, David Wajc:
  The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring. CoRR abs/2105.06944 (2021)
• 2020
• 
  Julia Watson, Barend Beekhuizen, Suzanne Stevenson:
  Coloring Outside the Lines: Error Patterns in Children's Acquisition of Color Terms. CogSci 2020
• 
  Olfa Harrabi, Jouhaina Chaouachi Siala:
  A New Sum Coloring-based Integer Linear Programming for Solving the University Course Timetabling Problem. OCTA 2020: 1-2
• 2018
• 
  Eugene Han, David Offner:
  Linear d-Polychromatic Q_d-1-Colorings of the Hypercube. Graphs Comb. 34(4): 791-801 (2018)
• 
  Patryk Mikos:
  A new lower bound for the on-line coloring of intervals with bandwidth. Theor. Comput. Sci. 708: 96-100 (2018)
• 
  Adalat Jabrayilov, Petra Mutzel:
  New Integer Linear Programming Models for the Vertex Coloring Problem. LATIN 2018: 640-652
• 2017
• 
  Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza:
  Coloring the cliques of line graphs. Discret. Math. 340(11): 2641-2649 (2017)
• 
  Adalat Jabrayilov, Petra Mutzel:
  New Integer Linear Programming Models for the Vertex Coloring Problem. CoRR abs/1706.10191 (2017)
• 
  Patryk Mikos:
  A new lower bound for the on-line coloring of intervals with bandwidth. CoRR abs/1702.03536 (2017)
• 2016
• 
  Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
  When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128: 165-173 (2016)
• 
  Luke Postle, Robin Thomas:
  Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. J. Comb. Theory B 119: 42-65 (2016)
• 2015
• 
  Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
  List Coloring in the Absence of a Linear Forest. Algorithmica 71(1): 21-35 (2015)
• 
  Mario Huicochea, Amanda Montejano:
  The Structure of Rainbow-free Colorings for Linear Equations on Three Variables in Zp. Integers 15A: A8 (2015)
• 
  Christian Kudahl:
  Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete. CIAC 2015: 313-324
• 
  Sabine Burgdorf, Monique Laurent, Teresa Piovesan:
  On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings. TQC 2015: 127-146
• 2014
• 
  Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li:
  The Linear t-Colorings of Sierpiński-Like Graphs. Graphs Comb. 30(3): 755-767 (2014)
• 
  Christian Kudahl:
  Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete. CoRR abs/1406.1623 (2014)
• 2013
• 
  Hanno Lefmann, Yury Person:
  Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. J. Graph Theory 73(1): 1-31 (2013)
• 2012
• 
  Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
  On the parameterized complexity of coloring graphs in the absence of a linear forest. J. Discrete Algorithms 15: 56-62 (2012)

skipping 25 more matches