Matthew Johnson

Cited by

	All	Since 2019
Citations	1405	765
h-index	20	16
i10-index	31	20

180

135

20032004200520062007200820092010201120122013201420152016201720182019202020212022202320244 8 5 3 15 10 17 16 20 35 22 57 69 91 113 117 151 162 143 137 112 59

Public access

View all

25 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Carl FeghaliCNRS, ENS Lyon, LIPVerified email at ens-lyon.fr
Konrad K. DabrowskiNewcastle UniversityVerified email at newcastle.ac.uk
Jan van den HeuvelProfessor of Mathematics, London School of EconomicsVerified email at lse.ac.uk
Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
Viresh PatelAssistant Professor, Mathematics, University of AmsterdamVerified email at uva.nl
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Giacomo PaesaniResearch FellowVerified email at uniroma1.it
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Nicolas BousquetCNRS, LIRIS, University Lyon 1, Univ. de LyonVerified email at liris.cnrs.fr
Martin MilaničUniversity of Primorska, Koper, SloveniaVerified email at upr.si
Anthony StewartPhD Student, Durham UniversityVerified email at durham.ac.uk
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Viktor ZamaraevUniversity of LiverpoolVerified email at liverpool.ac.uk
Erik Jan van LeeuwenUtrecht University, The NetherlandsVerified email at uu.nl
Shenwei HuangUniversity of New South WalesVerified email at unsw.edu.au
Nina ChiarelliUniversity of PrimorskaVerified email at famnit.upr.si
C A RodgerAuburn UniversityVerified email at auburn.edu
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl

Matthew Johnson

Professor in Computer Science, Durham University

Verified email at dur.ac.uk - Homepage

graph theory algorithms combinatorics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Finding paths between 3‐colorings L Cereceda, J van den Heuvel, M Johnson Journal of graph theory 67 (1), 69-82, 2011	172	2011
A survey on the computational complexity of coloring graphs with forbidden subgraphs PA Golovach, M Johnson, D Paulusma, J Song Journal of Graph Theory 84 (4), 331-363, 2017	142	2017
Connectedness of the graph of vertex-colourings L Cereceda, J van den Heuvel, M Johnson Discrete mathematics 308 (5), 913-919, 2008	142	2008
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs M Bonamy, M Johnson, I Lignos, V Patel, D Paulusma Journal of Combinatorial Optimization 27 (1), 132-143, 2014	121*	2014
Mixing 3-colourings in bipartite graphs L Cereceda, J Van den Heuvel, M Johnson European journal of combinatorics 30 (7), 1593-1606, 2009	86	2009
Finding shortest paths between graph colourings M Johnson, D Kratsch, S Kratsch, V Patel, D Paulusma Algorithmica 75 (2), 295-321, 2016	60	2016
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences C Feghali, M Johnson, D Paulusma Journal of Graph Theory, 2015	52*	2015
On a conjecture of Mohar concerning Kempe equivalence of regular graphs M Bonamy, N Bousquet, C Feghali, M Johnson Journal of Combinatorial Theory, Series B, 2018	42	2018
Some results on the Oberwolfach problem AJW Hilton, M Johnson Journal of the London mathematical society 64 (3), 513-522, 2001	41	2001
Independent Feedback Vertex Set for P 5 -Free Graphs M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Algorithmica 81 (4), 1342-1369, 2019	40	2019
Clique-width for hereditary graph classes KK Dabrowski, M Johnson, D Paulusma London Mathematical Society Lecture Note Series 456, 1-56, 2019	35	2019
Narrowing the complexity gap for colouring (Cs, Pt)-free graphs S Huang, M Johnson, D Paulusma The Computer Journal 58 (11), 3074-3088, 2015	31	2015
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity N Chiarelli, TR Hartinger, M Johnson, M Milanič, D Paulusma Theoretical Computer Science 705, 75-83, 2018	26	2018
Kempe equivalence of colourings of cubic graphs C Feghali, M Johnson, D Paulusma European Journal of Combinatorics 59, 1-10, 2017	24	2017
Amalgamations of connected k-factorizations AJW Hilton, M Johnson, CA Rodger, EB Wantland Journal of Combinatorial Theory, Series B 88 (2), 267-279, 2003	24	2003
Independent feedback vertex sets for graphs of bounded diameter M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Information Processing Letters 131, 26-32, 2018	22	2018
On cycle transversals and their connected variants in the absence of a small linear forest KK Dabrowski, C Feghali, M Johnson, G Paesani, D Paulusma, ... Algorithmica 82 (10), 2841-2866, 2020	21	2020
Transversals of subtree hypergraphs and the source location problem in digraphs J van den Heuvel, M Johnson Networks 51 (2), 113-119, 2008	21*	2008
Connected Vertex Cover for (sP1+P5)-Free Graphs M Johnson, G Paesani, D Paulusma Algorithmica 82 (1), 20-40, 2020	20	2020
Kempe equivalence of colourings of cubic graphs C Feghali, M Johnson, D Paulusma Electronic Notes in Discrete Mathematics 49, 243-249, 2015	20	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors