Mixing 3-Colourings in Bipartite Graphs
From MaRDI portal
Publication:3508565
DOI10.1007/978-3-540-74839-7_17zbMath1141.68521OpenAlexW2987442053MaRDI QIDQ3508565
Matthew Johnson, Jan van den Heuvel, Luis Cereceda
Publication date: 1 July 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/6084/1/6084.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances, Fixing improper colorings of graphs, Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
Cites Work