gCol

swMATH41492MaRDI QIDQ5973471FDOQ5973471

Author name not available (Why is that?)

Described by source

• A Guide to Graph Colouring

Cited In (26)

• Relaxing the assumptions of knockoffs by conditioning
• On Monte Carlo tree search for weighted vertex coloring
• Title not available (Why is that?)
• Finding happiness: an analysis of the maximum happy vertices problem
• Computing the chromatic number using graph decompositions via matrix rank
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
• Complexity of fall coloring for restricted graph classes
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• Tackling the maximum happy vertices problem in large networks
• The maximum happy induced subgraph problem: bounds and algorithms
• Adaptive feasible and infeasible tabu search for weighted vertex coloring
• An exact algorithm for the partition coloring problem
• Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
• List edge coloring of outer-1-planar graphs
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
• Guide to Graph Colouring
• A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
• A closed formula for the evaluation of foams
• Exact and approximate methods for the score-constrained packing problem
• Collective dynamics of phase-repulsive oscillators solves graph coloring problem
• Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
• An annotated bibliography on 1-planarity
• Capping methods for the automatic configuration of optimization algorithms
• Alternative representations of P systems solutions to the graph colouring problem
• Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
• The small stellated dodecahedron code and friends

This page was built for software: gCol