Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Reducing the Chromatic Number by Vertex or Edge DeletionsPicouleau, Christophe ; Paulusma, Daniël ; Ries, BernardElectronic notes in discrete mathematics, 2017-11, Vol.62, p.243-248Elsevier B.VTexto completo disponível |
|
2 |
Material Type: Artigo
|
The Complexity of Matching Games: A SurveyBenedek, Marton ; Biro, Peter ; Johnson, Matthew ; Paulusma, Daniel ; Ye, XinThe Journal of artificial intelligence research, 2023-01, Vol.77, p.459-485 [Periódico revisado por pares]Texto completo disponível |
|
3 |
Material Type: Artigo
|
On the diameter of reconfiguration graphs for vertex colouringsBonamy, Marthe ; Johnson, Matthew ; Lignos, Ioannis ; Patel, Viresh ; Paulusma, DaniëlElectronic notes in discrete mathematics, 2011-12, Vol.38, p.161-166Elsevier B.VTexto completo disponível |
|
4 |
Material Type: Artigo
|
Contracting Bipartite Graphs to Paths and CyclesDabrowski, Konrad K. ; Paulusma, DaniëlElectronic notes in discrete mathematics, 2017-08, Vol.61, p.309-315Elsevier B.VTexto completo disponível |
|
5 |
Material Type: Artigo
|
Acyclic, Star, and Injective Colouring: Bounding the DiameterBrause, Christoph ; Golovach, Petr ; Martin, Barnaby ; Ochem, Pascal ; Paulusma, Daniël ; Smith, SianiThe Electronic journal of combinatorics, 2022-06, Vol.29 (2) [Periódico revisado por pares]Open Journal SystemsTexto completo disponível |
|
6 |
Material Type: Artigo
|
Kempe Equivalence of Colourings of Cubic GraphsFeghali, Carl ; Johnson, Matthew ; Paulusma, DaniëlElectronic notes in discrete mathematics, 2015-11, Vol.49, p.243-249Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
A note on contracting claw-free graphsFiala, Jiří ; Kamiński, Marcin ; Paulusma, DaniëlDiscrete mathematics and theoretical computer science, 2013-08, Vol.15 no. 2 (Discrete Algorithms), p.223-232 [Periódico revisado por pares]DMTCSTexto completo disponível |
|
8 |
Material Type: Artigo
|
Squares of Low Clique NumberGolovach, Petr ; Kratsch, Dieter ; Paulusma, Daniël ; Stewart, AnthonyElectronic notes in discrete mathematics, 2016-11, Vol.55, p.195-198Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
What Graphs are 2-Dot Product Graphs?Johnson, Matthew ; van Leeuwen, Erik Jan ; Paulusma, DaniëlElectronic notes in discrete mathematics, 2015-11, Vol.49, p.705-711Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
The Complexity of Diameter on H-free graphsOostveen, Jelle J ; Paulusma, Daniël ; van Leeuwen, Erik JanarXiv.org, 2024-02Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |