default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Johnson 0002
- > Home > Persons > Matthew Johnson 0002
Publications
- 2021
[j48]Marthe Bonamy
, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98(1): 81-109 (2021)- 2020
- [j45]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - 2019
- [j43]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j40]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B 135: 179-199 (2019) - [c24]Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT 2019: 258-273 - [i21]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - 2018
- [j37]Carl Feghali, Matthew Johnson, Daniel Thomas:
Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. 236: 464-471 (2018) - [j36]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131: 26-32 (2018) - 2017
- [j34]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59: 1-10 (2017) - [c19]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c18]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [i14]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i13]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i12]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR abs/1707.09817 (2017) - 2016
- [j29]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory 83(4): 340-358 (2016) - 2015
- [j26]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. 49: 243-249 (2015) - [i8]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR abs/1501.05800 (2015) - [i7]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. CoRR abs/1503.03430 (2015) - [i5]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - 2014
- [c10]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) 2014: 287-298
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
