Counting subgraphs of coloring graphs

DOI10.1007/S00373-025-02938-1MaRDI QIDQ6942800zbMATH OpenFDO

Authors Shamil Asgarli, Sara Krehbiel, Howard W. Levinson, Heather M. Russell

Publication date 18 August 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-025-02938-1

zbMATH Keywords

chromatic polynomialcoloring graphsgraph invariantsreconfiguration systems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph polynomials (05C31)

Cites work

• A broken cycle theorem for the restrained chromatic function
• A chromatic symmetric function in noncommuting variables
• A Contribution to the Theory of Chromatic Polynomials
• A determinant formula for the number of ways of coloring a map.
• A logical expansion in mathematics.
• A note on graphs of k-colourings
• A symmetric function generalization of the chromatic polynomial of a graph
• An introduction to chromatic polynomials
• Block symmetries in graph coloring reconfiguration systems
• Classifying coloring graphs
• Combinatorics: the art of counting
• Connectedness of the graph of vertex-colourings
• Cut-colorings in coloring graphs
• Forbidden subgraphs of coloring graphs
• scientific article; zbMATH DE number 3769666 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Improved bounds for sampling colorings
• On chromatic equivalence of graphs
• On chromaticity of graphs
• Randomly coloring sparse random graphs with fewer colors than the maximum degree
• Reconfiguration graphs for dominating sets
• Reconfiguration graphs of shortest paths
• The \(k\)-dominating graph
• The geometry and topology of reconfiguration
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree

Cited in

(1)

• Coloring graphs as complete graph invariants

This page was built for publication: Counting subgraphs of coloring graphs

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