Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings

DOI10.1002/jgt.21846zbMath1330.05060arXiv1412.3493OpenAlexW1558652429MaRDI QIDQ3466338

Richard C. Brewster, Jonathan A. Noel

Publication date: 1 February 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3493

zbMATH Keywords

homomorphismmixingcoloringcoloring extensiondiscrete homotopydismantlablility

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph, Classifying coloring graphs, A dichotomy theorem for circular colouring reconfiguration, Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$, Recolouring homomorphisms to triangle-free reflexive graphs, Recolouring reflexive digraphs, Reconfiguring graph homomorphisms on the sphere, Reconfiguration of homomorphisms to reflexive digraph cycles, Hedetniemi's Conjecture and Strongly Multiplicative Graphs, Introduction to reconfiguration

Cites Work

• Unnamed Item
• Foldings in graphs and relations with simplicial complexes and posets
• Extending precolourings of circular cliques
• The core of a graph
• Kneser's conjecture, chromatic number, and homotopy
• On the restricted homomorphism problem
• Hom complexes and homotopy theory in the category of graphs
• Homotopy groups of Hom complexes of graphs
• Circular choosability is rational
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• The chromatic number of the product of two 4-chromatic graphs is 4
• You can't paint yourself into a corner
• Dismantlable graphs and posets, fixed clique property
• Extending graph colorings
• Gibbs measures and dismantlable graphs
• Vertex-to-vertex pursuit in a graph
• Connectedness of the graph of vertex-colourings
• Extending precolorings to circular colorings
• The complexity of change
• Finding paths between 3-colorings
• Gray code numbers for graphs
• A note on the star chromatic number
• Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
• On two questions about circular choosability
• Circular choosability
• Star chromatic number
• Circular choosability of graphs
• Operations with structures
• Circular chromatic number: A survey