The canonical coloring graphs of trees and cycles
From MaRDI portal
Publication:2892015
DOI10.26493/1855-3974.168.464zbMATH Open1247.05079OpenAlexW2097795038WikidataQ129355227 ScholiaQ129355227MaRDI QIDQ2892015FDOQ2892015
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
Recommendations
Cited In (9)
- Reconfiguring vertex colourings of 2-trees
- 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
- Title not available (Why is that?)
- 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)