Site

Publications

               UNDER CONSTRUCTION

See: list from DBLP

  • On (3,1)*-choosability of planar graphs without adjacent short cycles.
    Min Chen, André Raspaud .
    Discrete Applied Mathematics 162: 159-166 (2014)
  • Obstructions to locally injective oriented improper colourings.
    Gary MacGillivray, André Raspaud, Jacobus Swarts.
    Eur. J. Comb. 35: 402-412 (2014)
  • Generalized Power Domination in Regular Graphs.
    Paul Dorbec, Michael A. Henning, Christian Löwenstein, Mickael Montassier, and André Raspaud.
    SIAM J. Discrete Math. 27(3): 1559-1574 (2013)
  • Upper k-tuple domination in graphs.
    Paul Dorbec, G.J. Chang, H.K. Kim, A. Raspaud, H. Wang, W. Zhao.
    Discrete Mathematics & Theoretical Computer Science 14(2): 285-292 (2012)
  • On strong edge-colouring of graphs.
    H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov.
    Discrete Applied Mathematics 161(16-17): 2467-2479 (2013)
  • Limits of near-coloring of sparse graphs.
    P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud.
    Journal of Graph Theory 75(2): 191-202 (2014)
  • Steinberg's Conjecture and near-colorings.
    G.J. Chang, F. Havet, M. Montassier, and A. Raspaud.
    Manuscript, July 2011. Soumis ŕ Journal of Graph Theory.
  • Plane graphs with maximum degree 6 are edge-face 8-colorable.
    Min Chen, André Raspaud and Weifan Wang.
    Graphs and Combinatorics May 2013-pp. 1-13
  • On backbone coloring of graphs.\\

Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud.
Journal of Combinatorial Optimization, January 2012, Volume 23, Issue 1 , pp 79-93

  • 6-Star-Coloring of Subcubic Graphs.
    Min Chen, André Raspaud and Weifan Wang.
    Journal of Graph Theory 72(2): 128-145 (2013)
  • Star list chromatic number of planar subcubic graphs.
    Min Chen, André Raspaud and Weifan Wang.
    J. Comb. Optim. 27(3): 440-450 (2014)
  • Planar graphs without 4- and 5-cycles are acyclically 4-choosable.
    Min Chen and André Raspaud.
    Discrete Applied Mathematics 161(7-8): 921-931 (2013)
  • On the size of identifying codes in triangle-free graphs.
    Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud.
    Discrete Applied Mathematics, Volume 160, Issues 10–11, July 2012, Pages 1532-1546
  • Generalized power domination of graphs.\\

Paul Dorbec, G.J. Chang, M. Montassier, and A. Raspaud.
Discrete Appl. Math. 160(12) (2012), 1691--1698.

  • The minimum identifying code graphs.\\

André Raspaud, Li-Da Tong.
Discrete Applied Mathematics, Volume 160, Issue 9, June 2012, Pages 1385-1389.

  • L(p,q)-labelling of sparse graphs.
    Clément Charpentier, Mickaël Montassier and André Raspaud.
    Online First™, 26 May 2012 Journal of Combinatorial Optimization.

DOI: 10.1007/s10878-012-9507-6

  • Some results on the injective chromatic number of graphs.
    Min Chen, Gena Hanh, André Raspaud and Weifan Wang.
    J. Comb. Optim. 24(3): 299-318 (2012).
  • On backbone coloring of graphs.
    Weifan Wang, Yuehua Bu, Mickaël Montassier and André Raspaud.
    Journal of Combinatorial Optimization, Volume 23, Number 1, Pages 79-93

2012

  • Decomposing a graph into forests.
    Mickael Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu.
    Journal of Combinatorial Theory, Series B, Volume 102, Issue 1, January 2012, Pages 38-52
  • Vertex-arboricity of planar graphs without intersecting triangles.
    Min Chen, André Raspaud, Weifan Wang.
    European Journal of Combinatorics, Volume 33, Issue 5, July 2012, Pages 905-923
  • (k,1)-coloring of sparse graphs.
    O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.
    In Discrete Mathematics, 312(6):1128-1135, 2012.
  • Covering a Graph by Forest and a matching.
    Tomas Kaiser, Mickaël Montassier, André Raspaud.
    SIAM J. Discrete Math. 25, 1804 (2011)
  • Some structural properties of planar graphs and their applications to 3-choosability.
    M. Chen, M. Montassier, and A. Raspaud.
    In Discrete Mathematics, 312(2):362-373, 2012.
  • (k,j)-coloring of sparse graphs.
    O.V. Borodin, A.O. Ivanova, M. Montassier, and A. Raspaud.
    In Discrete Applied Mathematics, 159(17):1947 - 1953, 28 October 2011.
  • On acyclic 4-choosability of planar graphs without short cycles.
    Min Chen, André Raspaud.
    Discrete Mathematics, Volume 310, Issues 15-16, 28 August 2010, Pages 2113-2118
  • Homomorphism from sparse graphs to the Petersen graph.
    Min Chen, André Raspaud.
    Discrete Mathematics, Volume 310, Issue 20, 28 October 2010, Pages 2705-2713.
  • Acyclic 4-choosability of planar graphs without prescribed cycles.
    Min Chen, André Raspaud and Weifan Wang.
    soumis ŕ Journal of Graph Theory.
  • Acyclic 3-choosability of sparse graphs with girth at least 7.
    O. V. Borodin, M. Chen, A. O. Ivanova, A. Raspaud.
    Discrete Mathematics, Volume 310, Issues 17-18, 28 September 2010, Pages 2426-2434.
  • Injective Oriented Colourings.
    Gary MacGillivray, André Raspaud, Jacobus Swarts.
    Graph-Theoretic Concepts in Computer Science

Lecture Notes in Computer Science Volume 5911, 2010, pp 262-272.

  • 8-star-choosability of a graph with maximum average degree less than 3.
    Min Chen, André Raspaud and Weifan Wang,
    Discrete Mathematics & Theoretical Computer Science 13(3): 97-110 (2011)
  • Acyclic 4-choosability of planar graphs.
    Min Chen, André Raspaud, Nicolas Roussel and Xuding Zhu.
    Discrete Mathematics. Volume 311, Issue 1, 6 January 2011, Pages 92-101
  • Short cycle covers of graphs and nowhere-zero flows.\\

Edita Mácŕjová, André Raspaud, Michael Tarsi and Xuding Zhu.
Journal of Graph Theory, Volume 68, Issue 4, December 2011, Pages: 340–348,

  • Upper bounds on the linear chromatic of a graph.\\

Chao Li, Weifan Wang, André Raspaud.
Discrete Mathematics, Volume 311, Issue 4, 28 February 2011, Pages 232-238

  • Acyclic 3-choosability of sparse graphs with girth at least 7.
    O.V. Borodin, M. Chen, A.O. Ivanova, A. Raspaud.
    Discrete Mathematics,'''

Volume 310, Issues 17-18, 28 September 2010, Pages 2426-2434

  • 6-star-coloring of subcubic graphs.
    Min Chen, André Raspaud and Weifan Wang.
    Journal of Graph Theory,

Article first published online : 1 JUN 2012, DOI: 10.1002/jgt.21636

  • A sufficient condition for planar graphs to be acyclically 5-choosable.
    Min Chen and André Raspaud.
    Journal of Graph Theory 70(2): 135-151 (2012)
  • Vertex-arboricity of planar graphs without intersecting triangles.
    Min Chen, André Raspaud and Weifan Wang.
    Eur. J. Comb. 33(5): 905-923 (2012)
  • Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycle.
    O.V. Borodin, A.O. Ivanova , André Raspaud.
    Discrete Mathematics 310(21): 2946-2950 (2010)
  • Planar graphs without triangles adjacent to cycle of length from 4 to 7 are 3-colorable.
    O.V. Borodin, A.N. Glebov, A. Raspaud.
    Discrete Mathematics, Volume 310, Issue 20, 28 October 2010, Pages 2584-2594
  • Decomposition of sparse graphs, with application to game chromatic number.
    M. Montassier, A. Pęcher, A. Raspaud, D. West, and X. Zhu.
    In Discrete Mathematics 310 (10-11):1520--1523, 2010.
  • Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.
    O.V. Borodin, A.O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud.
    Journal of Graph Theory, Volume 65, Issue 2, October 2010, Pages: 83–93.
  • Planar graphs without adjacent cycles of length at most seven are 3-colorable.
    O.V. Borodin, M. Montassier, and A. Raspaud.
    In Discrete Mathematics, 310(1):167--173, 2010.
  • Decomposing graphs into forests.
    M. Montassier, P. Ossona de Mendez, A. Raspaud, and X. Zhu.
    In Journal of Combinatorial Theory, Series B, 102(1):38-52, 2012.
  • Decomposition of sparse graphs into two forests, one having bounded maximum degree.
    M. Montassier, A. Raspaud, and X. Zhu.
    Information Processing Letters, Volume 110, Issue 20, 30 September 2010, Pages 913-916.
  • Perfect matchings with restricted intersection in cubic graphs.
    Tomas Kaiser, André Raspaud.
    European Journal of Combinatorics, Volume 31, Issue 5, July 2010, Pages 1307-1315.
  • Some bounds on the injective chromatic number of graphs.
    Alain Doyon, Gena Hahn, André Raspaud.
    Discrete Mathematics, Volume 310, Issue 3, 6 February 2010, Pages 585-590
  • A note on the acyclic 3-choosability of some planar graphs.
    Hervé Hocquard, Mickaël Montassier, André Raspaud.
    Discrete Applied Mathematics, Volume 158, Issue 10, 28 May 2010, Pages 1104-1110
  • Circular flows in bidirected graphs.\\

André Raspaud Xuding Zhu.
J. Comb. Theory, Ser. B 101(6): 464-479 (2011)

  • Minmax degree of planar graphs,
    C. Charpentier, M. Montassier and A. Raspaud.
    EuroComb'11, August 2011, Budapest, France.
  • Generalized power domination of graphs.
    G. J. Chang, P. Dorbec, M. Montassier, and A. Raspaud.
    Discrete Applied Mathematics 160(12): 1691-1698 (2012)
  • Homomorphisms of 2-edge-colored graphs.
    A. Montejano, P. Ochem, A. Pinlou, A. Raspaud, E. Sopena.
    Discrete Applied Mathematics, Volume 158, Issue 12, 28 June 2010, Pages 1365-1379
  • A note on the acyclic 3-choosability of some planar graphs.
    H. Hocquard, M. Montassier, A. Raspaud.
    Discrete Applied Mathematics, Volume 158, Issue 10, 28 May 2010, Pages 1104-1110.
  • Projective, affine, and abelian colorings of cubic graphs.
    Kral D., Macajova E., Pangrac O., Raspaud A., Sereni J.-S., Skoviera M.
    European Journal of Combinatorics 30 (2009) 53-69
  • On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
    Bu Y., Lu H., Montassier M., Raspaud A., Wang W., Wang Y.
    Discrete Mathematics 309, 13 (2009) 4596-4607.
  • Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable.
    Min Chen, André Raspaud.
    ENDM, 34 (2009)659-667.
  • 3-colorability of planar graphs without 4-, 7- and 9-cycles.
    Y. Bu, H. Lu, M. Montassier, A. Raspaud, W. Wang, and Y. Wang.
    In Discrete Mathematics 309(13):4596-4607, 2009.
  • Star coloring of sparse graphs.
    Y. Bu, D.W. Cranston, M. Montassier, A. Raspaud and W. Wang.
    In Journal of Graph Theory, 62(3):201-219, 2009.
  • Injective coloring of planar graphs.
    Yuehua Bu, Dong Chen, André Raspaud, Weifan Wang.
    Discrete Applied Mathematics

Volume 157, Issue 4, 28 February 2009, Pages 663–672

  • Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.
    O.V. Borodin, A.N. Glebov, M. Montassier, and A. Raspaud.
    In Journal of Combinatorial Theory, Series B, 99(4):668-673, 2009.
  • An upper bound on the adaptable choosability of graphs.
    M. Montassier, A. Raspaud, and X. Zhu.
    In European Journal of Combinatorics, 30(2):351-355, 2009.
  • Linear coloring of planar graphs with large girth.
    André Raspaud, Weifan Wang.
    Discrete Maths Vol 309, 18. 5678-5686.
  • On Injective Colourings of Chordal Graphs.
    Pavol Hell, André Raspaud, Juraj Stacho.
    LATIN 2008: Theoretical Informatics

Lecture Notes in Computer Science Volume 4957, 2008, pp 520-530

  • Linear choosability of graphs.
    Esperet L., Montassier M., Raspaud A.
    Discrete Mathematics 308, 17 (2008) 3938-3950.
  • A relaxation of Havel's 3-color problem.
    Montassier M., Raspaud A., Wang W., Wang Y.
    Information Processing Letters 107, 3-4 (2008) 107-109.
  • On the vertex-arboricity of planar graphs.
    Raspaud A., Wang W.
    European Journal of Combinatorics 29, 4 (2008) 1064-1075.
  • Acyclic coloring of graphs of maximum degree five: Nine colors are enough.
    Fertin G., Raspaud A.
    Information Processing Letters (2008) 65-72.
  • Vertex labeling and routing in expanded Apollonian networks.
    Zhang Z., Comellas F., Fertin G., Raspaud A., Rong L., Zhou S.
    Journal of Physics A: Mathematical and Theoretical 41, 3 (2008) 035004.
  • (d,1)-total labeling of planar graphs with large girth and high maximum degree.
    Bazzaro F., Montassier M., Raspaud A.
    Discrete Mathematics 307 (2007) 2141-2151.
  • On Edge-maps whose Inverse Preserves Flows or Tensions.\\

Matt DeVos, Jaroslav Nešetřil, André Raspaud.
Graph Theory in Paris Trends in Mathematics 2007, pp 109-138.

  • L(p,q) labeling of d-Dimensional Grids.
    Fertin G., Raspaud A.
    Discrete Mathematics 307, 16 (2007) 2132-2140.
  • List circular coloring of trees and cycles.
    Raspaud A., Zhu X.
    Journal of Graph Theory 55 (2007) 249-265.
  • Acyclic 5-choosability of planar graphs without small cycles.
    Montassier M., Raspaud A., Wang W.
    Journal of Graph Theory 54 (2007) 245--260.
  • Three-coloring planar graphs without short cycles.
    Chen M., Raspaud A., Wang W.
    Information Processing Letters 101 (2007).
  • L(p,q) labeling of d-dimensional grids
    Fertin G., Raspaud A.
    Discrete Mathematics 307, 16 (2007) 2132-2140.
  • Bordeaux 3-color conjecture and 3-choosability.
    Montassier M., Raspaud A., Wang W.
    Discrete Mathematics 306, 6 (2006) 573-579.
  • On the acyclic choosability of graphs.
    Montassier M., Ochem P., Raspaud A.
    Journal of Graph Theory 51 (2006) 281--300.
  • (d,1)-total labeling of graphs with given maximum average degree.
    Montassier M., Raspaud A.
    Journal of Graph Theory 51 (2006) 93--109.
  • Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths.
    Mickaël Montassier, André Raspaud, Weifan Wang.
    Topics in Discrete Mathematics

Algorithms and Combinatorics Volume 26, 2006, pp 473-491

  • On oriented labelling parameters.
    Gonçalves D., Raspaud A., Shalu M.A.
    World Scientific 66 (2006) 33-45.
  • On the strong circular 5-flow conjecture.
    Raspaud A., Macajova E.
    Journal of Graph Theory 51 (2006) 281-300.
  • Preface. Electronic Notes in Discrete Mathematics.
    Delmas O., Raspaud A.
    Volume 22, 7th International Colloquium on Graph Theory,

(2005) 562.

  • Planar graphs without cycles of length from 4 to 7 are 3-colorable.
    Borodin O.V., Glebov A.N., Raspaud A., Salavatipour M.R.
    Journal of Combinatorial Theory Series B 93 (2005) 303-311.
  • A note on 2-facial coloring of plane graphs.
    Montassier M., Raspaud A.
    Information Processing Letters 98 (2005) 235--241.
  • No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes.
    Fertin G., Raspaud A., Sykora O.
    11th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2004), Slovaquie (2004).
  • Antisymmetric flows and edge-connectivity.
    Devos M., Nesetril J., Raspaud A.
    Discrete Mathematics (2004) 161-167.
  • Acyclic colouring of 1-planar graphs.
    O.V. Borodin, A.V. Kostochka, A. Raspaud, E. Sopena.
    Discrete Applied Mathematics, Volume 114, Issues 1–3, 30 October 2001, Pages 29-41
  • A survey on Knödel graphs.
    Guillaume Fertin, André Raspaud.
    Discrete Applied Mathematics, Volume 137, Issue 2, 1 March 2004, Pages 173-195
  • On Star Coloring of Graphs.

Guillaume Fertin, André Raspaud, Bruce Reed. Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science Volume 2204, 2001, pp 140-153

  • Estimating the minimal number of colors in acyclic k-strong colorings of maps on surfaces.
    O. V. Borodin, A. V. Kostochka, E. Sopena, A. Raspaud.
    Mathematical Notes, vol. 72, no. 1, 2002, pp. 31–33.
    Translated from Matematicheskie Zametki, vol. 72, no. 1, 2002, pp. 35–37.
    Original Russian Text Copyright c 2002 by O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena.
  • Colored Homomorphisms of Colored Mixed Graphs.
    Jaroslav Nesetril and Andr\'e Raspaud.
    J. Comb. Theory, Ser. B, 80 (2000),PP. 147155
  • Diameter of the Knödel Graph.
    Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrťo.
    Graph-Theoretic Concepts in Computer Science

Lecture Notes in Computer Science Volume 1928, 2000, pp 149-160

  • Antisymmetric flows and strong colourings of oriented graphs.
    Jaroslav Nesetril and Andr\'e Raspaud.
    Annales de l'institut Fourier, 49.3 (1999): 1037-1056
  • Families of Graphs Having Broadcasting and Gossiping Properties.
    Guillaume Fertin, André Raspaud.
    Graph-Theoretic Concepts in Computer Science

Lecture Notes in Computer Science Volume 1517, 1998, pp 63-77

  • Periodic gossiping in back-to-back trees.
    Roger Labahn, André Raspaud.
    Discrete Applied Mathematics, Volume 75, Issue 2, 30 May 1997, Pages 157-168
  • Compatible eulerian circuits in Kn∗∗.
    D. Barth, J. Bond, A. Raspaud.
    Discrete Applied Mathematics, Volume 56, Issues 2–3, 27 January 1995, Pages 127-136

En préparation :

Blix theme adapted by David Gilbert, powered by PmWiki