Coloring graphs as complete graph invariants

DOI10.1016/J.DISC.2026.115245MaRDI QIDQ7313995zbMATH OpenFDO

Authors Shamil Asgarli, Sara Krehbiel, Howard W. Levinson

Publication date 13 August 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115245

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)

Cites work

• A note on graphs of k-colourings
• Classifying coloring graphs
• Complexity results in graph reconstruction
• Congruent Graphs and the Connectivity of Graphs
• Connectedness of the graph of vertex-colourings
• Counting subgraphs of coloring graphs
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Forbidden subgraphs of coloring graphs
• Introduction to reconfiguration
• On graphs determined by their Tutte polynomials
• Recoloring graphs via tree decompositions
• The complexity of change
• The search for chromatically unique graphs
• The search for chromatically unique graphs. II
• Topics in graph automorphisms and reconstruction
• Which graphs are determined by their spectrum?

This page was built for publication: Coloring graphs as complete graph invariants

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