Generation of Colourings and Distinguishing Colourings of Graphs

DOI10.1007/978-3-319-21840-3_7zbMath1444.68137OpenAlexW2119786326MaRDI QIDQ3449807

William H. Bird, Wendy J. Myrvold

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_7

zbMATH Keywords

graph theorycoloringscombinatorial generationdistinguishing coloringsgraph distinguishability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing the distinguishing numbers of trees and forests
• Constructing the vertex-transitive graphs of order 24
• \(C^ k\)-resolution of semialgebraic mappings, addendum to volume growth and entropy
• Efficient representation of perm groups
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• A note on the asymptotic and computational complexity of graph distinguishability
• The distinguishing number of the hypercube
• Distinguishing numbers for graphs and groups
• Symmetry breaking in graphs
• The distinguishing number of the augmented cube and hypercube powers
• The maximum distinguishing number of a group
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• A compact representation for permutation groups

This page was built for publication: Generation of Colourings and Distinguishing Colourings of Graphs