Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
From MaRDI portal
Publication:6093150
DOI10.1002/JGT.22870zbMath1522.05098arXiv2008.12185OpenAlexW4289885984MaRDI QIDQ6093150
Benjamin Moore, Richard C. Brewster
Publication date: 6 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.12185
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy theorem for circular colouring reconfiguration
- Computational complexity of compaction to irreflexive cycles
- On the complexity of reconfiguration problems
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Mixing 3-colourings in bipartite graphs
- Reconfiguration in bounded bandwidth and tree-depth
- The coloring reconfiguration problem on specific graph classes
- Recolouring reflexive digraphs
- Reconfiguring graph homomorphisms on the sphere
- A Thomassen-type method for planar graph recoloring
- Introduction to reconfiguration
- The complexity of change
- Homomorphism reconfiguration via homotopy
- Finding paths between 3-colorings
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
- A note on the star chromatic number
- Circular colouring and graph homomorphism
- Graph homomorphism reconfiguration and frozen H‐colorings
- Distributed Recoloring
- Circular chromatic number: A survey
This page was built for publication: Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
