Site

Publication

For project members: please do not forget to acknowledge the support from ANR in your publications.

Examples of acknowledgement:
This work is supported by the ANR project HOSIGRA (ANR-17-CE40-0022).
This work is partially supported by the ANR project HOSIGRA (ANR-17-CE40-0022).

List of the papers written with support of this project is as follows:

  • Published journal papers
    • F. Dross and P. Ochem. Vertex partitions of (C3,C4,C6)-free planar graphs. Discrete Math. 342(11) (2019), 3229-3236.
    • F. Dross, M. Montassier, and A. Pinlou. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs, Discrete Mathematics, vol. 342, pp. 943-950, 2019.
    • F. Dross, M. Montassier, and A. Pinlou. Large induced forests in planar graphs with girth 4, Discrete Applied Mathematics, vol. 254, pp. 96-106, 2019.
    • O. Etesami, N. Ghareghani, M. Habib, M. Hooshmandasl, R. Naserasr, P. Sharifani. When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780: 54--65 (2019),
    • J. I. Kokkala, K. Meagher, R. Naserasr, K. J. Nurmela, P. R. J. Östergård, and Brett Stevens. On the Structure of Small Strength-2 Covering Arrays. J Combin Des. 2019. https://doi.org/10.1002/jcd.21671
    • D. Lajou. On the achromatic number of signed graphs. Theoretical Computer Science, 759 (2019), 50-60.
    • F. Ramezani, Coloring problem of signed interval graphs. Transactions on Combinatorics, Transactions on Combinatorics, Vol. 8 No. 3 (2019), pp. 29-37.
    • L. Beaudou, F. Foucaud and R. Naserasr. Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discrete Applied Mathematics 261:40-51, 2019.
    • M. Chen. R. Naserasr. The optimal routing of Augmented cubes. Information Processing Letters, 136 (2018), 59-63.
  • Conferences:
    • F. Foucaud, H. Hocquard, D. Lajou, V. Mitsou, T. Pierron. Parameterized complexity of edge-coloured and signed graph homomorphisms.14th International Symposium on Parameterized and Exact Computation, IPEC 2019, Munich, Germany, September 11–13, 2019.
    • E. Sopena. Recent Developments on Homomorphisms and Colourings of Signed Graphs. Colourings, Independence and Domination, 18th workshop on Graph Theory, CID'19, Piechowice, Poland (Invited talk), September 15-20, 2019.
    • R. Naserasr. Homomorphisms of sparse signed graphs. 4th Macedonian Workshop on Graph Theory and Applications, (Invited talk), 26-30 Avgust 2019, Ohrid
    • L. Beaudou, F. Foucaud, F. Madelaine, L. Nourine, G. Richard. Complexity of conjunctive regular path query homomorphisms. Proceedings of Computability in Europe 2019, Lecture Notes in Computer Science 11558:108-119, 2019.
    • R. Naserasr. Homomorphisms of signed graphs. 2018 Winter International workshop on Graph theory, Jinhua, Zhejiang, China (Invited talk), December 2018.
  • Submitted:
    • F. Foucaud, B. Gras, A. Perez and F. Sikora. On the complexity of broadcast domination and multipacking in digraphs.
    • F. Foucaud, R. Klasing, M. Miller and J. Ryan. Monitoring the edges of a graph using distances.
    • D. Chakraborty, F. Foucaud, H. Gahlawat, S. K. Ghosh and B. Roy. Hardness and approximation for the geodetic set problem in some graph classes.
    • S. Dey, F. Foucaud, S. C. Nandy and A. Sen. Discriminating codes in geometric setups.
    • J. Dybizbanski, P. Ochem, A. Pinlou, and A. Szepietowski. Oriented cliques and colorings of graphs with low maximum degree.
    • R. Naserasr, E. Sopena and T. Zaslavsky. Homomorphisms of signed graphs: an update.
    • C. Charpentier, R. Naserasr and E. Sopena. Homomorphisms of sparse signed graphs.
    • P. Charbit, G. Hahn,, M. Kaminski, M. Lafond, N. Lichiardopol, R. Naserasr, B. Seamone and R. Sherkati. Edge clique covers in graphs with independence number.
    • P. Charbit, M. Habib, L. Mouatadid, and R. Naserasr. A New Graph Parameter To Measure Linearity Linear Structure and Graph Classes.
    • L. Beaudou, F. Foucaud, R. Naserasr. Smallest not C2l+1-colourable graphs of odd-girth 2k+1.
    • F. Dross, F. Foucaud, V. Mitsou, P. Ochem, T. Pierron. Complexity of homomorphisms of planar signed graphs to cycles.
    • M. Chen. R. Naserasr. Homomorphisms of partial t-trees and edge-coloring of partial 3-trees.
    • F. Kardoš, J. Narboni. On the 4-color theorem for signed graphs.
    • M. Bonamy, N. Bousquet, K.K. Dabrowski, M. Johnson, D. Paulusma, T. Pierron. Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.
    • M. Bonamy, T. Pierron, E. Sopena. Every planar graph with Δ⩾8 is totally (Δ+2)-choosable.