vix.ing · top · new · best · stats · spec

Bonamy, Marthe

  1. The Perfect Matching Reconfiguration Problem
    2019/04/12 by Marthe Bonamy, Nicolás Bousquet, Bonamy, Marthe +13 · 4 citations
    Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Search Problems
  2. On a conjecture of Mohar concerning Kempe equivalence of regular graphs
    2015/10/23 by Bonamy, Marthe, Bousquet, Nicolas, Feghali, Carl +1 · 3 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  3. Recoloring bounded treewidth graphs
    2013/02/14 by Bonamy, Marthe, Bousquet, Nicolas · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  4. Recoloring graphs via tree decompositions
    2014/03/25 by Bonamy, Marthe, Bousquet, Nicolas · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  5. Token Sliding on Chordal Graphs
    2016/05/02 by Bonamy, Marthe, Bousquet, Nicolas · 2 citations
    #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  6. Gallai's path decomposition conjecture for graphs of small maximum degree
    2016/09/20 by Bonamy, Marthe, Perrett, Thomas · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  7. Shorter Labeling Schemes for Planar Graphs
    2019/08/09 by Bonamy, Marthe, Gavoille, Cyril, Pilipczuk, Michal · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  8. Dominating sets reconfiguration under token sliding
    2019/12/06 by Marthe Bonamy, Paul Dorbec, Bonamy, Marthe +3 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #Distributed systems and fault tolerance #FOS: Computer and information sciences
  9. Improved pyrotechnics : Closer to the burning graph conjecture
    2021/10/20 by Bastide, Paul, Bonamy, Marthe, Bonato, Anthony +4 · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
  10. Graphs with large chromatic number induce 3k-cycles
    2014/08/10 by Bonamy, Marthe, Charbit, Pierre, Thomassé, Stéphan · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  11. Independent Feedback Vertex Set for P5-free Graphs
    2017/07/28 by Bonamy, Marthe, Dabrowski, Konrad K., Feghali, Carl +2 · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  12. EPTAS for Max Clique on Disks and Unit Balls
    2018/03/05 by Bonamy, Marthe, Bonnet, Édouard, Bousquet, Nicolas +2 · 1 citation
    #68Q25 #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences
  13. Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications
    2018/10/15 by Bonamy, Marthe, Perrett, Thomas, Postle, Luke · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  14. Avoidable paths in graphs
    2019/08/10 by Bonamy, Marthe, Defrain, Oscar, Hatzel, Meike +1 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  15. Fractional vertex-arboricity of planar graphs
    2020/09/25 by Marthe Bonamy, František Kardoš, Bonamy, Marthe +5 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics
  16. The structure of binary matroids with no induced claw or Fano plane restriction
    2018/06/11 by Marthe Bonamy, Bonamy, Marthe, František Kardoš +7 · 1 citation
    Computer Science · #Advanced Graph Theory Research
  17. Distributed Recoloring
    2018/02/19 by Marthe Bonamy, Paul Ouvrard, Bonamy, Marthe +7 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Interconnection Networks and Systems #Parallel #and Cluster Computing (cs.DC)
  18. On Vizing's edge colouring question
    2021/07/16 by Bonamy, Marthe, Defrain, Oscar, Klimošová, Tereza +2 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  19. Kempe changes in degenerate graphs
    2021/12/04 by Marthe Bonamy, Vincent Delecroix, Bonamy, Marthe +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
  20. Optimal labelling schemes for adjacency, comparability, and reachability
    2020/12/03 by Bonamy, Marthe, Esperet, Louis, Groenland, Carla +1 · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  21. On cuts of small chromatic number in sparse graphs
    2025/10/02 by Aubian, Guillaume, Bonamy, Marthe, Bourneuf, Romain +2 · 2 citations
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  22. Surfaces have (asymptotic) dimension 2
    2020/07/07 by Marthe Bonamy, Bonamy, Marthe, Nicolás Bousquet +9 · 1 citation
    Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Group Theory (math.GR) #Metric Geometry (math.MG) #Point processes and geometric inequalities