Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six

DOI10.1155/2019/4073905zbMath1442.05113OpenAlexW2920565532MaRDI QIDQ2337023

M. Gómez-Fuentes, J. Cervantes-Ojeda, Mika Olsen, Diego González-Moreno

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/4073905

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectivity of cages with girth five, six and eight
• On genetic algorithms for the packing of polygons
• Rainbow connectivity of Moore cages of girth 6
• Rainbow connections of graphs: a survey
• Dynamic cage survey
• Applying genetic algorithms for solving nonlinear algebraic equations
• Moore graphs and beyond: a survey of the degree/diameter problem
• The rainbow connectivity of a graph
• On Moore Graphs with Diameters 2 and 3
• Rainbow connection in graphs
• Hardness and Algorithms for Rainbow Connectivity

This page was built for publication: Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six