Generation of Colourings and Distinguishing Colourings of Graphs

DOI10.1007/978-3-319-21840-3_7MaRDI QIDQ3449807zbMATH OpenOpenAlexFDO

Authors William H. Bird, Wendy 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

coloringscombinatorial generationdistinguishing coloringsgraph distinguishabilitygraph theory

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1052826
• Distinguishing graphs by total colourings
• Generation of colored graphs with isomorphism rejection
• scientific article; zbMATH DE number 3912409
• Colourings of graphs by labellings
• Distinguishing graphs by edge-colourings
• On generalized graph colorings
• General vertex-distinguishing total coloring of graphs
• scientific article; zbMATH DE number 3935075

Cites work

• C^ k-resolution of semialgebraic mappings, addendum to volume growth and entropy
• A compact representation for permutation groups
• A note on the asymptotic and computational complexity of graph distinguishability
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• Constructing the vertex-transitive graphs of order 24
• Distinguishing numbers for graphs and groups
• Efficient representation of perm groups
• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3702903 (Why is no real title available?)
• scientific article; zbMATH DE number 898423 (Why is no real title available?)
• scientific article; zbMATH DE number 6180530 (Why is no real title available?)
• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• On computing the distinguishing numbers of trees and forests
• Symmetry breaking in graphs
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The distinguishing number of the augmented cube and hypercube powers
• The distinguishing number of the hypercube
• The maximum distinguishing number of a group

Cited in

(5)

• A note on computable distinguishing colorings
• CsegGraph: a graph colouring instance generator
• Generation of colored graphs with isomorphism rejection
• Software for proper vertex-colouring exploiting graph symmetry
• Distinguishing number of inverse graphs of finite groups: labeling the symmetry

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

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