The canonical coloring graph of trees and cycles

DOI10.26493/1855-3974.168.464zbMath1247.05079OpenAlexW2097795038WikidataQ129355227 ScholiaQ129355227MaRDI QIDQ2892015

Ruth Haas

Publication date: 18 June 2012

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.168.464

zbMATH Keywords

graph coloringcanonical coloring

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Classifying coloring graphs ⋮ Unnamed Item ⋮ Forbidden subgraphs of coloring graphs ⋮ Block symmetries in graph coloring reconfiguration systems ⋮ Reconfiguration graphs of zero forcing sets ⋮ The \(k\)-dominating graph ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs ⋮ Introduction to reconfiguration

This page was built for publication: The canonical coloring graph of trees and cycles