, The solution of the four-color-map problem, Sci. Amer, vol.237, issue.152, pp.108-121, 1977.
, Every planar map is four colorable, volume 98 of Contemporary Mathematics, 1989.
, The Moore Bound for Irregular Graphs, Graphs and Combinatorics, vol.18, issue.1, pp.53-57, 2002.
DOI : 10.1007/s003730200002
, Degrees and choice numbers. Random Structures Algorithms, pp.364-368, 2000.
, Coverings of graphs by cycles, Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing, pp.7-14, 1986.
, Generalizations of tait coloring of cubic graphs, Problems in Topological Graph Theory, 1995.
, Colorings and orientations of graphs, Combinatorica, vol.29, issue.2, pp.125-134, 1992.
DOI : 10.1007/BF01204715
, T-choosability in graphs, Discrete Applied Mathematics, vol.82, issue.1-3, pp.1-13, 1998.
DOI : 10.1016/S0166-218X(97)00124-8
, Approximation of pathwidth of outerplanar graphs, Journal of Algorithms, vol.43, issue.2, pp.190-200, 2002.
DOI : 10.1016/S0196-6774(02)00001-9
, Capture of an intruder by mobile agents, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '02, 2002.
DOI : 10.1145/564870.564906
, Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs, Journal of Algorithms, vol.21, issue.2, pp.358-402, 1996.
DOI : 10.1006/jagm.1996.0049
, Unit disk graph recognition is NP-hard, Computational Geometry, vol.9, issue.1-2, pp.3-24, 1998.
DOI : 10.1016/S0925-7721(97)00014-X
, Chordal embeddings of planar graphs, Discrete Mathematics, vol.273, issue.1-3, pp.85-10201, 2003.
DOI : 10.1016/S0012-365X(03)00230-9
, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput, vol.25, issue.6, pp.1305-1317, 1996.
, A partial k-arboretum of graphs with bounded treewidth Criterion of chromaticity of a degree prescription, Abstracts of IV All-Union Conf. on Theoretical Cybernetics (Novosibirsk), pp.1-45, 1977.
, Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskret, Analiz. Bor92. O. V. Borodin. Cyclic coloring of plane graphs. Discrete Math, vol.41, issue.1001-3, pp.12-26281, 1984.
, A new proof of the 6 color theorem, J. Graph Theory, vol.19, issue.4, pp.507-521, 1995.
, An intuitive approach to speleotopology On colouring the nodes of a network Monotonicity in graph searching On cyclic colorings and their generalizations, Proc. Cambridge Philos. Soc, pp.72-78194, 1941.
, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.1, issue.2, pp.187-195205, 1986.
DOI : 10.1002/jgt.3190100207
, Around a brooks' like theorem for improper colouring, 2006.
, Pathwidth of outerplanar graphs, Journal of Graph Theory, vol.32, issue.1, 2006.
DOI : 10.1002/jgt.20218
URL : https://hal.archives-ouvertes.fr/inria-00070220
, Pathwidth of outerplanar graphs, Journal of Graph Theory, vol.32, issue.1, 2006.
DOI : 10.1002/jgt.20218
URL : https://hal.archives-ouvertes.fr/inria-00070220
, Rerouting requests in WDM networks Graphs with small process number, Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05) Presqu'île de Giens, pp.17-20, 2005.
, The maximum k-dependent and f-dependent set problem, Algorithms and computation (Hong Kong, pp.88-97, 1993.
DOI : 10.1007/3-540-57568-5_238
, Exact and Approximate Solutions for the Gate Matrix Layout Problem, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.6, issue.1, pp.79-84, 1987.
DOI : 10.1109/TCAD.1987.1270248
, Five-line configurations in Steiner triple systems, Utilitas Math, vol.49, pp.153-159, 1996.
, A survey of graph layout problems, ACM Computing Surveys, vol.34, issue.3, pp.313-356, 2002.
DOI : 10.1145/568522.568523
, List-colouring squares of sparse subcubic graphs, 2005.
, Minimum partition of a matroid into independent subsets, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.1 and 2, pp.67-72, 1965.
DOI : 10.6028/jres.069B.004
, Defective list colorings of planar graphs, Bull. Inst. Combin . Appl, vol.25, pp.79-87, 1999.
, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing Congress. Numer., XXVI, pp.125-157, 1979.
, The Vertex Separation and Search Number of a Graph, Information and Computation, vol.113, issue.1, pp.50-79, 1994.
DOI : 10.1006/inco.1994.1064
, Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth, Combinatorics, Probability and Computing, vol.7, issue.4, pp.375-386, 1998.
DOI : 10.1017/S0963548398003678
, 2-Visibility drawings of planar graphs, Proceedings of Graph Drawing '96, pp.155-168, 1996.
DOI : 10.1007/3-540-62495-3_45
, Pathwidth of Planar and Line Graphs, Graphs and Combinatorics, vol.19, issue.1, pp.91-99, 2003.
DOI : 10.1007/s00373-002-0490-z
, Fulkerson???s Conjecture and Circuit Covers, Journal of Combinatorial Theory, Series B, vol.61, issue.1, pp.133-138, 1994.
DOI : 10.1006/jctb.1994.1039
, On self duality of pathwidth in polyhedral graph embeddings, Journal of Graph Theory, vol.14, issue.1, 2006.
DOI : 10.1002/jgt.20219
, Blocking and anti-blocking pairs of polyhedra, Mathematical Programming, vol.69, issue.1, pp.168-194, 1971.
DOI : 10.1007/BF01584085
, Some lower bounds for a class of frequency assignment problems, IEEE Transactions on Vehicular Technology, vol.35, pp.8-14, 1986.
, Computers and intractability, 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences
, On the asymptotic value of the choice number of complete multi-partite graphs, Journal of Graph Theory, vol.101, issue.2, pp.123-134, 2006.
DOI : 10.1002/jgt.20137
, Approximating the pathwidth of outerplanar graphs, Information Processing Letters, vol.68, issue.1, pp.17-23, 1998.
DOI : 10.1016/S0020-0190(98)00139-2
, Cycle covers of graphs, 1988.
, Algorithmic graph theory and perfect graphs, 1980.
, Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe, vol.8, pp.109-120, 1958.
, On Coloring Unit Disk Graphs, Algorithmica, vol.20, issue.3, pp.277-293, 1998.
DOI : 10.1007/PL00009196
, Choice numbers of graphs, 1992.
, Labelling Graphs with a Condition at Distance 2, SIAM Journal on Discrete Mathematics, vol.5, issue.4, pp.586-595, 1992.
DOI : 10.1137/0405048
, Frequency assignment: Theory and applications, Proceedings of the IEEE, vol.68, issue.12, pp.1497-1514, 1980.
DOI : 10.1109/PROC.1980.11899
, On some properties of 4-regular plane graphs, Journal of Graph Theory, vol.29, issue.2, pp.163-175, 1995.
DOI : 10.1002/jgt.3190200206
, Representing graphs by disks and balls (a survey of recognition-complexity results) Discrete Math, Combinatorics , graph theory, algorithms and applications, pp.101-124, 2001.
, The combinatorial distance geometry method for the calculation of molecular conformation. I. A new approach to an old problem, Journal of Theoretical Biology, vol.104, issue.3, pp.359-381, 1983.
DOI : 10.1016/0022-5193(83)90112-1
, Circular choosability, Journal of Graph Theory, vol.48, issue.3, 2006.
DOI : 10.1002/jgt.20375
URL : https://hal.archives-ouvertes.fr/inria-00086981
, Improper Colourings of Unit Disk Graphs, Proceedings of the 7th International Conference on Graph Theory (ICGT'05), pp.123-128, 2005.
DOI : 10.1016/j.endm.2005.06.022
, Improper Colourings of Unit Disk Graphs, Electronic Notes in Discrete Mathematics, vol.22, 2006.
DOI : 10.1016/j.endm.2005.06.022
, Colouring of cubic graphs by Steiner triple systems, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.57-66, 2004.
DOI : 10.1016/j.jctb.2003.10.003
, Improper choosability of graphs and maximum average degree, Journal of Graph Theory, vol.146, issue.3, pp.181-199, 2006.
DOI : 10.1002/jgt.20155
URL : https://hal.archives-ouvertes.fr/inria-00071425
, 3-facial colouring of plane graphs, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00083533
, Streaming meshes, Proceedings of Visualisa- tion'05, pp.231-238, 2005.
, On nowhere-zero flows in multigraphs, Proceedings of the Fifth British Combinatorial Conference, pp.373-378, 1975.
, Flows and generalized coloring theorems in graphs, Journal of Combinatorial Theory, Series B, vol.26, issue.2, pp.205-216, 1979.
DOI : 10.1016/0095-8956(79)90057-1
, Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000.
, Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1995.
, The vertex separation number of a graph equals its path-width, Information Processing Letters, vol.42, issue.6, pp.345-350, 1992.
DOI : 10.1016/0020-0190(92)90234-M
, Unions of perfect matchings in cubic graphs
, Group-constrained edge-colorings of cubic graphs, 2006.
, Improper colouring of (random) unit disk graphs, Proceedings of European Conference on Combinatorics, Graph Theory and Applications, pp.193-198, 2005.
DOI : 10.1016/j.disc.2007.07.070
URL : https://hal.archives-ouvertes.fr/inria-00070259
, Cyclic, diagonal and facial colorings, European J. Combin, vol.26, pp.3-4473, 2005.
, Improper colouring of (random) unit disk graphs, Discrete Mathematics, vol.308, issue.8, 2006.
DOI : 10.1016/j.disc.2007.07.070
URL : https://hal.archives-ouvertes.fr/inria-00070259
, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.
DOI : 10.1016/0304-3975(86)90146-5
, Recontamination does not help to search a graph, J. Assoc. Comput. Mach, vol.40, issue.2, pp.224-245, 1993.
, Structuration des graphes planaires, 1999.
, Methods and Algorithms for Radio Channel Assignment, Oxford Lecture Series in Mathematics and Its Applications, 2002.
, The cellular concept. The Bell System Technical Journal, pp.15-43, 1978.
, The complexity of searching a graph, J. Assoc. Comput. Mach, vol.35, issue.1, pp.18-44, 1988.
, Improper choosability of graphs embedded on the surface of genus r, Discrete Math, vol.269, issue.1-3, pp.311-314, 2003.
, Linear algorithms to recognize outerplanar and maximal outerplanar graphs, Information Processing Letters, vol.9, issue.5, pp.229-232, 1979.
DOI : 10.1016/0020-0190(79)90075-9
, Topics in intersection graph theory, SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), 1999.
DOI : 10.1137/1.9780898719802
, Colouring random geometric graphs, Proceedings of European Conference on Combinatorics, Graph Theory and Applications, pp.1-4, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184397
, On the chromatic number of random geometric graphs, Combinatorica, vol.48, issue.1, 2006.
DOI : 10.1007/s00493-011-2403-3
, Choosability for the circular chromatic number, 2003.
, Colouring proximity graphs in the plane, Discrete Mathematics, vol.199, issue.1-3, pp.123-137, 1999.
DOI : 10.1016/S0012-365X(98)00292-1
, Channel assignment and weighted coloring, Networks, vol.29, issue.2, pp.114-117, 2000.
DOI : 10.1002/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G
, Abelian Colourings of Cubic Graphs, Proceedings of the 7th International Conference on Graph Theory (ICGT'05), pp.333-339, 2005.
DOI : 10.1016/j.endm.2005.06.080
, Fano colourings of cubic graphs and the Fulkerson Conjecture, Theoretical Computer Science, vol.349, issue.1, pp.112-120, 2005.
DOI : 10.1016/j.tcs.2005.09.034
, Two-point concentration in random geometric graphs, Combinatorica, vol.34, issue.4, 2005.
DOI : 10.1007/s00493-008-2283-3
, Cyclic coloration of plane graphs, Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, pp.287-293, 1968.
, Pursuit-evasion in a graph, Theory and applications of graphs (Proc. Internat. Conf., Western Mich, pp.426-441, 1976.
DOI : 10.1007/BFb0070400
, The search number of a connected graph, Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing Congress. Numer., XXI, pp.549-554, 1978.
, On coloring j-unit sphere graphs, 1991.
, Focusing of the scan statistic and geometric clique number, Advances in Applied Probability, vol.34, issue.4, pp.739-753, 2002.
DOI : 10.1239/aap/1037990951
, Random Geometric Graphs, 2003.
, Etude d'un problème algorithmique intervenant dans la reconfiguration des réseaux WDM, 2004.
, Orthogonal drawing of high degree graphs with small area and few bends, Proceedings of 5th Workshop on Algorithms and Data Structures, pp.354-367, 1998.
DOI : 10.1007/3-540-63307-3_74
, Treewidth and tangles : an new connectivity measure and some applications, Surveys in Combinatorics, pp.87-162, 1997.
, From garbage to rainbows : Generalizations of graph colorings and their applications, Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, 1989.
, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5
, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1999.1919
, The complexity of satisfiability problems, Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, pp.216-226, 1978.
, A linear algorithm for the pathwidth of trees, Topics in Combinatorics and Graph Theory, pp.613-620, 1990.
, Optimal embedding of a tree into an interval graph in linear time, Fourth Czechoslovakian Symposium on Combinatorics , Graphs and Complexity (Prachatice, pp.287-291, 1990.
, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc. (3), pp.423-460, 1979.
, Computing optimal linear layouts of trees in linear time, Algorithms?ESA, pp.403-414, 2000.
, Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time, J. Algorithms, vol.47, issue.1, pp.40-59, 2003.
, A Gr??tzsch-Type Theorem for List Colourings with Impropriety One, Combinatorics, Probability and Computing, vol.8, issue.5, pp.493-507, 1999.
DOI : 10.1017/S096354839900396X
, List Improper Colourings of Planar Graphs, Combinatorics, Probability and Computing, vol.8, issue.3, pp.293-299, 1999.
DOI : 10.1017/S0963548399003752
, List improper colorings of planar graphs with prescribed girth, Discrete Mathematics, vol.214, issue.1-3, pp.221-233, 2000.
DOI : 10.1016/S0012-365X(99)00145-4
, Fractionnal Graph Theory : A Rationnal Approach to the Theory of Graphs, 1997.
, Characterisations of outerplanar graphs, Discrete Math, vol.26, issue.1, pp.47-53, 1979.
, On d???diagonal colorings, Journal of Graph Theory, vol.22, issue.2, pp.155-166, 1996.
DOI : 10.1002/(SICI)1097-0118(199606)22:2<155::AID-JGT6>3.3.CO;2-8
, On ${\bi d}$ -Diagonal Colorings of Embedded Graphs of Low Maximum Face Size, Graphs and Combinatorics, vol.14, issue.1, pp.81-94, 1998.
DOI : 10.1007/s003730050017
, A New Bound on the Cyclic Chromatic Number, Journal of Combinatorial Theory, Series B, vol.83, issue.1, pp.102-111, 2001.
DOI : 10.1006/jctb.2001.2046
, Every Planar Graph Is 5-Choosable, Journal of Combinatorial Theory, Series B, vol.62, issue.1, pp.180-181, 1994.
DOI : 10.1006/jctb.1994.1062
URL : http://doi.org/10.1006/jctb.1994.1062
, A theory of 3-connected graphs, Proc. Ser. A 64 = Indag, pp.441-455, 1961.
DOI : 10.1016/S1385-7258(61)50045-5
, Graph theory, volume 21 of Encyclopedia of Mathematics and its Applications, 1984.
, Interval graphs and maps of DNA, Bulletin of Mathematical Biology, vol.48, issue.2, pp.189-195, 1986.
DOI : 10.1016/S0092-8240(86)80006-4
, Circular list colorings of some graphs, Journal of Applied Mathematics and Computing, vol.229, issue.1???3, pp.149-156, 2006.
DOI : 10.1007/BF02831929
, Discrete Isoperimetric Problems, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.860-870, 1977.
DOI : 10.1137/0132073
, A polynomial algorithm for the min-cut linear arrangement of trees, Journal of the ACM, vol.32, issue.4, pp.950-988, 1985.
DOI : 10.1145/4221.4228
, Circular choosability of graphs, Journal of Graph Theory, vol.8, issue.3, pp.210-218, 2005.
DOI : 10.1002/jgt.20051