Software for proper vertex-colouring exploiting graph symmetry

DOI10.1007/978-3-031-64529-7_12MaRDI QIDQ6637798

Leonard H. Soicher

Publication date: 13 November 2024

zbMATH Keywords

chromatic numbergraph symmetry\textsf{GAP}\textsf{GRAPE}minimum vertex-colouringproper vertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Title not available (Why is that?)
• Classification algorithms for codes and designs
• Minimal and canonical images
• Practical graph isomorphism. II.
• Finding the smallest image of a set
• Guide to Graph Colouring
• Strongly Regular Graphs
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• Using GAP packages for research in graph theory, design theory, and finite geometry

This page was built for publication: Software for proper vertex-colouring exploiting graph symmetry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637798)