Mixing 3-colourings in bipartite graphs-Reference-Cited by-同舟云学术

Mixing 3-colourings in bipartite graphs

Published:2009-10 Issue:7 Volume:30 Page:1593-1606
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Cereceda Luis,van den Heuvel Jan,Johnson Matthew

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference11 articles.

1. Exactly Solved Models in Statistical Mechanics;Baxter,1982

2. J. Billingham, R. Leese, H. Rajaniemi, Frequency reassignment in cellular phone networks. Smith Institute Study Group Report (2005). Available via http://www.smithinst.ac.uk/Projects/ESGI53/ESGI53-Motorola/Report/

3. P. Bonsma, L. Cereceda, Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances. CDAM Research Report LSE-CDAM-2007-12 (2007). Available via http://www.cdam.lse.ac.uk/Reports/Abstracts/cdam-2007-12.html; Mathematical Foundations of Computer Science 2007, Proceedings of 32nd International Symposium MFCS 2007, in: Lect. Notes Comput. Sc., vol. 4708, 2007, pp.738–749 (extended abstract)

4. Connectedness of the graph of vertex-colourings;Cereceda;Discrete Math.,2008

5. L. Cereceda, J. van den Heuvel, M. Johnson, Finding paths between 3-colourings, CDAM Research Report LSE-CDAM-2007-31 (2007). Available via http://www.cdam.lse.ac.uk/Reports/Abstracts/cdam-2007-31.html

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Redicolouring digraphs: Directed treewidth and cycle-degeneracy;Discrete Applied Mathematics;2024-10

2. Digraph redicolouring;European Journal of Combinatorics;2024-02

3. Mixing is hard for triangle-free reflexive graphs;European Journal of Combinatorics;2024-02

4. 5‐Coloring reconfiguration of planar graphs with no short odd cycles;Journal of Graph Theory;2023-12-06

5. Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring;Journal of Graph Theory;2023-12-06