A Guide to Graph Colouring
From MaRDI portal
Publication:3450578
DOI10.1007/978-3-319-25730-3zbMath1330.05002OpenAlexW4231176537MaRDI QIDQ3450578
Publication date: 6 November 2015
Full work available at URL: https://doi.org/10.1007/978-3-319-25730-3
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items (21)
Finding happiness: an analysis of the maximum happy vertices problem ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ The small stellated dodecahedron code and friends ⋮ Unnamed Item ⋮ On Monte Carlo tree search for weighted vertex coloring ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ An annotated bibliography on 1-planarity ⋮ An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Collective dynamics of phase-repulsive oscillators solves graph coloring problem ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ Highly Scalable Bayesian Geostatistical Modeling via Meshed Gaussian Processes on Partitioned Domains ⋮ Relaxing the assumptions of knockoffs by conditioning ⋮ A closed formula for the evaluation of foams ⋮ Unnamed Item ⋮ The maximum happy induced subgraph problem: bounds and algorithms ⋮ Efficient multigrid solution of elliptic interface problems using viscosity-upwinded local discontinuous Galerkin methods ⋮ Alternative representations of P systems solutions to the graph colouring problem ⋮ gCol ⋮ COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
This page was built for publication: A Guide to Graph Colouring
