212 4.1.2 Properties of polynomial closures, p.214 ,
, A variant of the polynomial closure, p.215
, Organization of the chapter
218 4.2.1 From separation to pairs, p.224 ,
236 4.3.1 Satisfiability for quantified Boolean formulas, Pol(C)-separation is, p.247 ,
Algebraic framework: ?-semigroups ,
On small faces in 4-critical planar graphs, Ars Combinatoria, vol.32, pp.203-207, 1991. ,
Coloring powers of planar graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.4, pp.651-662, 2003. ,
Some algorithmic problems for pseudovarieties, vol.54, pp.531-552, 1999. ,
On decidability of intermediate levels of concatenation hierarchies, International Conference on Developments in Language Theory, pp.58-70, 2015. ,
Pointlike sets with respect to r and j, Journal of Pure and Applied Algebra, vol.212, issue.3, pp.486-499, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00306430
, Representations of relatively free profinite semigroups, irreducibility, and order primitivity, 2015.
, The pseudovariety is hyperdecidable. RAIRO-Theoretical Informatics and Applications, vol.31, pp.457-482, 1997.
, Combinatorial Nullstellensatz. Combinatorics, Probability and Computing, vol.8, issue.1-2, pp.7-29, 1999.
Colorings and orientations of graphs, Combinatorica, vol.12, issue.2, pp.125-134, 1992. ,
A unified approach to distance-two colouring of graphs on surfaces, Combinatorica, vol.33, issue.3, pp.253-296, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00924016
Every planar map is four colorable. Part I: Discharging, Illinois Journal of Mathematics, vol.21, issue.3, pp.429-490, 1977. ,
Opérations polynomiales et hiérarchies de concaténation, Theoretical Computer Science, vol.91, issue.1, pp.71-84, 1991. ,
Graphs and their chromatic numbers, 1965. ,
Characterizations of derived graphs, Journal of Combinatorial theory, vol.9, issue.2, pp.129-135, 1970. ,
The common fragment of ACTL and LTL, Foundations of Software Science and Computational Structures, FoSSaCS'08, vol.4962, pp.172-185, 2008. ,
Star height via games, Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.214-219, 2015. ,
List-colourings of graphs, Graphs and Combinatorics, vol.1, issue.1, pp.115-127, 1985. ,
A new upper bound for the list chromatic number, Discrete Mathematics, vol.74, issue.1-2, pp.65-75, 1989. ,
, , 2015.
, SIAM Journal on Discrete Mathematics, vol.29, issue.3, pp.1735-1763
Brooks' theorem on powers of graphs, Discrete Mathematics, vol.325, pp.12-16, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01264422
Planar graphs of girth at least five are square (? + 2)-choosable, Journal of Combinatorial Theory, Series B, vol.134, pp.218-238, 2019. ,
List coloring the square of sparse graphs with large degree, European Journal of Combinatorics, vol.41, pp.128-137, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01233445
Every planar graph with ? 8 is totally (? + 2)-choosable, 2019. ,
Coupled colorings of graphs on a plane, 1987. ,
, , vol.45, pp.21-27
On the total coloring of planar graphs, Journal für die reine und angewandte Mathematik, vol.394, pp.180-185, 1989. ,
Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs, Mathematical Notes of the Academy of Sciences of the USSR, vol.48, issue.6, pp.1186-1190, 1990. ,
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings, Journal of Graph Theory, vol.21, issue.2, pp.183-186, 1996. ,
To the paper of H.L. Abbott and B. Zhou on 4-critical planar graphs, Ars Combinatoria, vol.43, pp.191-192, 1996. ,
Colorings of plane graphs: A survey, Discrete Mathematics, vol.313, issue.4, pp.517-539, 2013. ,
Stars and bunches in planar graphs. Part II: General planar graphs and colourings, CDAM Research Report, vol.5, 2002. ,
Sufficient conditions for planar graphs to be 2-distance (? + 1)-colourable. Sibirskie Ehlektronnye Matematicheskie Izvestiya, vol.1, pp.129-141, 2004. ,
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Sibirskie Ehlektronnye Matematicheskie Izvestiya, vol.3, pp.428-440, 2006. ,
Planar graphs without cycles of length from 4 to 7 are 3-colorable, Journal of Combinatorial Theory, Series B, vol.93, issue.2, pp.303-311, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00307587
2-distance (? + 2)-coloring of planar graphs with girth six and ? 18, Discrete Mathematics, vol.309, pp.6496-6502, 2009. ,
List 2-distance (? + 2)-coloring of planar graphs with girth six, European Journal of Combinatorics, vol.30, issue.5, pp.1257-1262, 2009. ,
List edge and list total colourings of multigraphs, Journal of Combinatorial Theory, Series B, vol.71, issue.2, pp.184-204, 1997. ,
Total colorings of planar graphs with large maximum degree, Journal of Graph Theory, vol.26, issue.1, pp.53-59, 1997. ,
A sufficient condition for planar graphs to be 3-colorable, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.17-27, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00307586
Equations defining the polynomial closure of a lattice of regular languages, International Colloquium on Automata, Languages, and Programming, pp.115-126, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00423494
On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, pp.194-197, 1941. ,
Canonical regular expressions and minimal state graphs for definite events, Mathematical theory of Automata, vol.12, issue.6, pp.529-561, 1962. ,
Open problems about regular languages, Formal Language Theory: Perspectives and Open Problems, pp.23-47, 1980. ,
The dot-depth hierarchy of star-free languages is infinite, Journal of Computer and System Sciences, vol.16, issue.1, pp.37-55, 1978. ,
Injective coloring of planar graphs, Discrete Applied Mathematics, vol.157, issue.4, pp.663-672, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00411739
Two smaller upper bounds of list injective chromatic number, Journal of Combinatorial Optimization, vol.29, issue.2, pp.373-388, 2015. ,
Weak second-order arithmetic and finite automata, vol.6, pp.66-92, 1960. ,
Origin of the name "mathematical induction, The American Mathematical Monthly, vol.25, pp.197-201, 1918. ,
The L(h, k)-labelling problem: an updated survey and annotated bibliography, The Computer Journal, vol.54, issue.8, pp.1344-1371, 2011. ,
The L(2, 1)-labeling problem on graphs, SIAM Journal on Discrete Mathematics, vol.9, issue.2, pp.309-316, 1996. ,
Some results on the injective chromatic number of graphs, Journal of Combinatorial Optimization, vol.24, issue.3, pp.299-318, 2012. ,
An improvement of Hind's upper bound on the total chromatic number, Combinatorics, Probability and Computing, vol.5, issue.2, pp.99-104, 1996. ,
Finite-automaton aperiodicity is PSPACEcomplete, Theoretical Computer Science, vol.88, issue.1, pp.99-116, 1991. ,
Painting and correspondence coloring of squares of planar graphs with no 4-cycles. Combinatorica (Accepted with minor revision), 2018. ,
Planar graphs with maximum degree ? 9 are (? + 1)-edge-choosable-A short proof, Discrete Mathematics, vol.310, issue.21, pp.3049-3051, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-01338378
Dot-depth of star-free events, Journal of Computer and System Sciences, vol.5, issue.1, pp.1-16, 1971. ,
Steinberg's conjecture is false, Journal of Combinatorial Theory, Series B, vol.122, pp.452-456, 2017. ,
List-coloring the square of a subcubic graph, Journal of Graph Theory, vol.57, issue.1, pp.65-87, 2008. ,
Painting squares in ? 2 ? 1 shades, The Electronic Journal of Combinatorics, vol.23, issue.2, pp.2-50, 2016. ,
An introduction to the discharging method via graph coloring, Discrete Mathematics, vol.340, issue.4, pp.766-793, 2017. ,
Efficient separability of regular languages by subsequences and suffixes, Automata, Languages, and Programming. ICALP 2013, vol.7966, pp.150-161, 2013. ,
A survey on small fragments of first-order logic over finite words, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.513-548, 2008. ,
Fragments of first-order logic over infinite words. Theory of Computing Systems, vol.48, pp.486-516, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00359319
2-distance coloring of planar graphs without 4-cycles or 5-cycles, 2017. ,
Some bounds on the injective chromatic number of graphs, Discrete Mathematics, vol.310, issue.3, pp.585-590, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00411723
Coloring squares of planar graphs with girth six, European Journal of Combinatorics, vol.29, issue.4, pp.838-849, 2008. ,
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8, Journal of Combinatorial Theory, Series B, vol.129, pp.38-54, 2018. ,
Transition graphs and the star-height of regular events, The Michigan Mathematical Journal, vol.10, issue.4, pp.385-397, 1963. ,
Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol.98, issue.1, pp.21-51, 1961. ,
Choosability in graphs, Proceedings of West Coast Conference on Combinatorics, Graph Theory and Computing, vol.26, pp.125-157, 1979. ,
Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica, vol.16, issue.1, pp.1-28, 2003. ,
Edge colorings in bipartite graphs, 1966. ,
Languages of dot-depth 3/2. Theory of Computing Systems, vol.42, pp.256-286, 2008. ,
On the L(p, 1)-labelling of graphs, Discrete Mathematics, vol.308, issue.8, pp.1405-1414, 2008. ,
Labelling graphs with a condition at distance 2, SIAM Journal on Discrete Mathematics, vol.5, issue.4, pp.586-595, 1992. ,
Graph labellings with variable weights, a survey, Discrete Applied Mathematics, vol.157, issue.12, pp.2646-2658, 2009. ,
Ein Dreifarbensatz fur dreikreisfreie Netze auf der Kugel, vol.8, pp.109-120, 1959. ,
New bounds on the list-chromatic index of the complete graph and other simple graphs, Combinatorics, Probability and Computing, vol.6, issue.3, pp.295-313, 1997. ,
On the injective chromatic number of graphs, Discrete Mathematics, vol.256, issue.1-2, pp.179-192, 2002. ,
Representation theorems on regular languages, vol.27, pp.101-115, 1983. ,
Algorithms for determining relative star height and star height, Information and Computation, vol.78, issue.2, pp.124-169, 1988. ,
Griggs and Yeh's conjecture and L(p, 1)-labelings, SIAM Journal on Discrete Mathematics, vol.26, issue.1, pp.145-168, 2012. ,
List colouring squares of planar graphs, Electronic Notes in Discrete Mathematics, vol.29, pp.515-519, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00303303
Pointlike sets: the finest aperiodic cover of a finite semigroup, Journal of Pure and Applied Algebra, vol.55, issue.1-2, pp.85-126, 1988. ,
Aperiodic pointlikes and beyond, International Journal of Algebra and Computation, vol.20, issue.02, pp.287-305, 2010. ,
An upper bound for the total chromatic number, Graphs and Combinatorics, vol.6, issue.2, pp.153-159, 1990. ,
, , 1988.
On moore graphs with diameters 2 and 3, IBM Journal of Research and Development, vol.4, issue.5, pp.497-504, 1960. ,
On moore graphs with diameters 2 and 3, Selected Papers Of Alan J Hoffman: With Commentary, pp.377-384, 2003. ,
The NP-completeness of edge-coloring, SIAM Journal on Computing, vol.10, issue.4, pp.718-720, 1981. ,
Graph Coloring Problems, Series in Discrete Mathematics and Optimization, 1995. ,
Graph Coloring Analogues with a Condition at Distance Two: L(2, 1)-labellings and List ?-labellings, 1993. ,
Space-bounded reducibility among combinatorial problems, Journal of Computer and System Sciences, vol.11, issue.1, pp.68-85, 1975. ,
List total colourings of graphs, Combinatorics, Probability and Computing, vol.7, issue.2, pp.181-188, 1998. ,
Graphs of degree 4 are 5-edge-choosable, Journal of Graph Theory, vol.32, issue.3, pp.250-264, 1999. ,
Asymptotically good list-colorings, Journal of Combinatorial Theory, Series A, vol.73, issue.1, pp.1-59, 1996. ,
Distance desert automata and the star height problem, RAIRO-Theoretical Informatics and Applications, vol.39, issue.3, pp.455-509, 2005. ,
Representation of events in nerve nets and finite automata, 1951. ,
A semigroup characterization of dot-depth one languages, RAIRO -Theoretical Informatics and Applications, vol.17, issue.4, pp.321-330, 1983. ,
The total coloring of a multigraph with maximal degree 4, Discrete Mathematics, vol.17, issue.2, pp.161-163, 1977. ,
The total chromatic number of any multigraph with maximum degree five is at most seven, Discrete Mathematics, vol.162, issue.1-3, pp.199-214, 1996. ,
Total-coloring of plane graphs with maximum degree nine, SIAM Journal on Discrete Mathematics, vol.22, issue.4, pp.1462-1479, 2008. ,
A theorem about the channel assignment problem, SIAM Journal on Discrete Mathematics, vol.16, issue.3, pp.426-437, 2003. ,
Level two of the quantifier alternation hierarchy over infinite words. Theory of Computing Systems, vol.62, pp.467-480, 2018. ,
The 3-choosability of plane graphs of girth 4, Discrete Mathematics, vol.294, issue.3, pp.297-301, 2005. ,
Coloring the square of an outerplanar graph, Taiwanese Journal of Mathematics, vol.10, issue.4, pp.1015-1023, 2006. ,
Injective colorings of planar graphs with few colors, Discrete Mathematics, vol.309, issue.18, pp.5636-5649, 2009. ,
Products of group languages, International Conference on Fundamentals of Computation Theory, pp.285-299, 1985. ,
Separability by piecewise testable languages is PTimecomplete, Theoretical Computer Science, vol.711, pp.109-114, 2018. ,
Symbolic logic and automata. Wright Air Development Division, Air Research and Development Command, 1960. ,
Counter-Free Automata (MIT research monograph no. 65), 1971. ,
The distance coloring of graphs, Acta Mathematica Sinica, English Series, vol.30, issue.9, pp.1579-1587, 2014. ,
A bound on the total chromatic number, Combinatorica, vol.18, issue.2, pp.241-280, 1998. ,
Near-optimal list colorings, Random Structures & Algorithms, vol.17, issue.3-4, pp.376-402, 2000. ,
A bound on the chromatic number of the square of a planar graph, Journal of Combinatorial Theory, Series B, vol.94, issue.2, pp.189-213, 2005. ,
Recent results on automata and infinite words, International Symposium on Mathematical Foundations of Computer Science, pp.134-148, 1984. ,
First-order logic and star-free sets, Journal of Computer and System Sciences, vol.32, issue.3, pp.393-406, 1986. ,
Infinite words: automata, semigroups, logic and games, Pure and Applied Mathematics Series. Elsevier, vol.141, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00112831
A Brooks-like result for graph powers, European Conference on Combinatorics, Graph Theory and Applications, 2019. ,
Quantifier alternation for infinite words, Foundations of Software Science and Computation Structures. FoSSaCS, vol.9634, pp.234-251, 2016. ,
Locally trivial categories and unambiguous concatenation, Journal of Pure and Applied Algebra, vol.52, issue.3, pp.297-311, 1988. ,
Induction Schemes: From Language Separation to Graph Colorings BIBLIOGRAPHY, 1986. ,
A variety theorem without complementation, Russian Mathematics (Izvestija vuzov. Matematika), vol.39, pp.80-90, 1995. ,
Syntactic semigroups, Handbook of formal languages, pp.679-746, 1997. ,
URL : https://hal.archives-ouvertes.fr/hal-00143946
An explicit formula for the intersection of two polynomials of regular languages, International Conference on Developments in Language Theory, pp.31-45, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-01247099
Monoids of upper triangular boolean matrices, Semigroups. Structure and Universal AIgebraic Problems, vol.39, pp.259-272, 1981. ,
URL : https://hal.archives-ouvertes.fr/hal-00870684
Polynomial closure and unambiguous product, International Colloquium on Automata, Languages, and Programming, pp.348-359, 1995. ,
URL : https://hal.archives-ouvertes.fr/hal-01248158
Polynomial closure and unambiguous product. Theory of Computing Systems, vol.30, pp.383-422, 1997. ,
URL : https://hal.archives-ouvertes.fr/hal-01248158
The wreath product principle for ordered semigroups, Communications in Algebra, vol.30, issue.12, pp.5677-5713, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00112618
Separating regular languages with two quantifiers alternations, Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.202-213, 2015. ,
Going higher in the first-order quantifier alternation hierarchy on words, Automata, Languages, and Programming. ICALP, vol.8573, pp.342-353, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00997939
Separating regular languages with firstorder logic, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, vol.75, pp.978-979, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01005349
Adding successor: A transfer theorem for separation and covering, 2017. ,
The covering problem, 2017. ,
Generic results for concatenation hierarchies, Theory of Computing Systems, pp.1-53, 2017. ,
Separation for dot-depth two, 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp.1-12, 2017. ,
The complexity of separation for levels in concatenation hierarchies, 2018. ,
A generic characterization of Pol(C), 2018. ,
Separating without any ambiguity, 45th International Colloquium on Automata, Languages and Programming, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01798847
Separation and covering for group based concatenation hierarchies, 2019. ,
Choosability of powers of circuits, Graphs and Combinatorics, vol.19, issue.1, pp.137-144, 2003. ,
On the total coloring of certain graphs, Israel Journal of Mathematics, vol.9, issue.3, pp.396-402, 1971. ,
Labeling chordal graphs: distance two condition, SIAM Journal on Discrete Mathematics, vol.7, issue.1, pp.133-140, 1994. ,
A note on the three color problem, Graphs and Combinatorics, vol.11, issue.1, pp.91-94, 1995. ,
On total 9-coloring planar graphs of maximum degree seven, Journal of Graph Theory, vol.31, issue.1, pp.67-73, 1999. ,
On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.190-194, 1965. ,
Piecewise testable events, Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, pp.214-222, 1975. ,
Induction Schemes: From Language Separation to Graph Colorings BIBLIOGRAPHY, 1997. ,
A delay theorem for pointlikes, Semigroup Forum, vol.63, issue.3, pp.281-304, 2001. ,
The state of the three color problem, Annals of Discrete Mathematics, vol.55, pp.211-248, 1993. ,
A generalization of the Schützenberger product of finite monoids, Theoretical Computer Science, vol.13, issue.2, pp.137-150, 1981. ,
Finite semigroup varieties of the form V * D, Journal of Pure and Applied Algebra, vol.36, pp.53-94, 1985. ,
First-order logic and aperiodic languages: a revisionist history, ACM SIGLOG News, vol.5, issue.3, pp.4-20, 2018. ,
Diamonds are forever: The variety DA, Semigroups, Algorithms, Automata and Languages, pp.475-499, 2002. ,
Classification of finite monoids: the language approach, Theoretical Computer Science, vol.14, issue.2, pp.195-208, 1981. ,
Classifying regular events in symbolic logic, Journal of Computer and System Sciences, vol.25, issue.3, pp.360-376, 1982. ,
Every planar graph is 5-choosable, Journal of Combinatorial Theory, Series B, vol.62, issue.1, pp.180-181, 1994. ,
3-list-coloring planar graphs of girth 5, Journal of Combinatorial Theory, Series B, vol.64, issue.1, pp.101-107, 1995. ,
The square of a planar cubic graph is 7-colorable, Journal of Combinatorial Theory, Series B, vol.128, pp.192-218, 2018. ,
Finite automata and the logic of single-place predicates, Doklady Akademii Nauk, vol.140, pp.326-329, 1961. ,
Coloring the square of a planar graph, Journal of Graph Theory, vol.42, issue.2, pp.110-124, 2003. ,
The separation problem for regular languages by piecewise testable languages, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00817347
On total chromatic number of a graph, Journal of the London Mathematical Society, vol.2, issue.3, pp.405-408, 1971. ,
On an estimate of the chromatic index of a p-graph (in Russian), Metody Diskretnogo Analiza, vol.3, pp.25-30, 1964. ,
Critical graphs with given chromatic class, 1965. ,
, , vol.5, pp.9-17
Vertex colourings with given colours (in Russian), Metody Diskretnogo Analiza, vol.29, pp.3-10, 1976. ,
List colourings of planar graphs, Discrete Mathematics, vol.120, issue.1-3, pp.215-219, 1993. ,
A not 3-choosable planar graph without 3-cycles, Discrete Mathematics, vol.146, issue.1-3, pp.325-328, 1995. ,
Total chromatic number of planar graphs with maximum degree ten, Journal of Graph Theory, vol.54, issue.2, pp.91-102, 2007. ,
Labelling planar graphs without 4-cycles with a condition on distance two, Discrete Applied Mathematics, vol.156, issue.12, pp.2241-2249, 2008. ,
Labeling planar graphs with conditions on girth and distance two, SIAM Journal on Discrete Mathematics, vol.17, issue.2, pp.264-275, 2003. ,
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable, Discrete Applied Mathematics, vol.159, issue.4, pp.232-239, 2011. ,
Graphs with given diameter and a coloring problem, 1977. ,
Über den kartographischen vierfarbensatz, Mathematische Annalen, vol.58, issue.3, pp.413-426, 1904. ,
An Eilenberg theorem for ?-languages, International Colloquium on Automata, Languages, and Programming, pp.588-599, 1991. ,
Colouring graphs with respect to distance, 1996. ,
Every planar graph with maximum degree 7 is of class 1, Graphs and Combinatorics, vol.16, issue.4, pp.467-495, 2000. ,
Labeling planar graphs without 4, 5-cycles with a condition on distance two, SIAM Journal on Discrete Mathematics, vol.26, issue.1, pp.52-64, 2012. ,