Certified Bounds on the Fractional Chromatic Number of Planar Graphs by Learned Subgraph Selection: code, instances and certificates
Code, instances, certificates and results for the paper "Certified Bounds on the Fractional Chromatic Number of Planar Graphs by Learned Subgraph Selection". The method computes certified lower bounds on the fractional chromatic number of planar graphs. A graph neural network ranks vertices, a small induced subgraph is...