The canonical coloring graphs of trees and cycles

DOI10.26493/1855-3974.168.464MaRDI QIDQ2892015zbMATH OpenOpenAlexWikidataFDO

Authors 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) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
• Classifying coloring graphs
• Ordered colourings
• Canonical Ramsey numbers and properly colored cycles
• Connected sequential colourings

Cited in

(9)

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

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

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