Genetic algorithm and edge-colorings of complete graphs with connected classes

Documents similaires

• Coloring graphs as complete graph invariants
  par: Asgarli, Shamil, et autres
  Publié: (2025)
• On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
  par: Zaker, Manouchehr
  Publié: (2024)
• Minimal obstructions to $C_5$-coloring in hereditary graph classes
  par: Goedgebeur, Jan, et autres
  Publié: (2024)
• An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
  par: Mkrtchyan, Vahan
  Publié: (2024)
• $\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
  par: Zaker, Manouchehr
  Publié: (2024)