List of some publications related to "Combinatorial Reconfiguration"
Posted by Duc A HoangDuc A Hoang on 10 Feb 2019 07:01, last edited by Duc A HoangDuc A Hoang on 10 Oct 2019 09:05

This page contains a non-exhaustive list of publications related to Combinatorial Reconfiguration, a research area in Computer Science. The publications are categorized by year. Everyone can edit this site by becoming a member. (See all members of this site.)

Extra Materials

2019

  • Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan and Sebastian Siebertz. On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. (Preprint: arXiv:1910.00581).
  • Stephen Finbow and Christopher M. van Bommel. $\gamma$-Graphs of Trees. (Preprint: arXiv:1907.03158).
  • Nicolas Bousquet and Valentin Bartier. Linear transformations between colorings in chordal graphs. (Preprint: arXiv:1907.01863).
  • Alexandre Blanché, Haruka Mizuta, Paul Ouvrard and Akira Suzuki. Decremental Optimization of Dominating Sets Under Reachability Constraints. (Preprint: arXiv:1906.05163).
  • Carl Feghali. Reconfiguring colourings of graphs with bounded maximum average degree. (Preprint: arXiv:1904.12698).
  • Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec and Alexi Turcotte. Token Swapping on Trees. (Preprint: arXiv:1903.06981).
  • Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann and Csaba D. Tóth. Reconfiguration of Connected Graph Partitions. (Preprint: arXiv:1902.10765).
  • Carl Feghali and Jiří Fiala. Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. (Preprint: arXiv:1902.08071).
  • Carl Feghali. Reconfiguring $10$-colourings of planar graphs. (Preprint: arXiv:1902.02278).


2018

  • Tatsuhiko Hatanaka, Takehiro Ito and Xiao Zhou. Complexity of Reconfiguration Problems for Constraint Satisfaction. (Preprint: arXiv:1812.10629).
  • Marthe Bonamy, Nicolas Bousquet and Guillem Perarnau. Frozen $(\Delta+1)$-colourings of bounded degree graphs. (Preprint: arXiv:1811.12650).
  • Eduard Eiben and Carl Feghali. Towards Cereceda's conjecture for planar graphs. (Preprint: arXiv:1810.00731).
  • Matt DeVos, Adam Dyck, Jonathan Jedwab and Samuel Simon. Which graphs occur as $\gamma$-graphs? (Preprint: arXiv:1810.01583).
  • Jae-Baek Lee, Jonathan A. Noel and Mark Siggers. Reconfiguring Graph Homomorphisms on the Sphere. (Preprint: arXiv:1810.01111).


2017

  • Richard C. Brewster, Jae-Baek Lee, Benjamin Moore, Jonathan A. Noel and Mark Siggers. Graph Homomorphism Reconfiguration and Frozen $H$-Colourings. (Preprint: arXiv:1712.00200).


2016

  • Anna Lubiw, Vinayak Pathak. Reconfiguring Ordered Bases of a Matroid. (Preprint: arXiv:1612.00958).


2015

  • Daniel C. McDonald. Connectedness and Hamiltonicity of graphs on vertex colorings. (Preprint: arXiv:1507.05344).


2014

  • Marthe Bonamy and Nicolas Bousquet. Reconfiguring Independent Sets in Cographs. (Preprint: arXiv:1406.1433).


2013


2012

2011

2010

  • Somkiat Trakultraipruk. Connectedness of Strong $k$-Colour Graphs. (Preprint: arXiv:1009.4440).

2009

2008

2007

2006

  • Bojan Mohar. Kempe Equivalence of Colorings, Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge, pp. 287-297. Trends in Mathematics. Birkhäuser Basel.

2005

1999

1994

  • Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan and Hisao Tamaki. Motion planning on a graph. Proceedings of SFCS 1994, pp. 511-520, IEEE.

Download

File nameFile typeSize
core.bibASCII English text79.96 kBInfo
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License