Paulusma, Daniel
- Kempe Equivalence of Colourings of Cubic Graphs
2015/03/11 by Feghali, Carl, Johnson, Matthew, Paulusma, Daniel · 2 citations
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Obtaining Planarity by Contracting Few Edges
2012/04/23 by Petr A. Golovach, Golovach, Petr A., Pim van ’t Hof +3 · 1 citation
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Search Problems
- Editing to a Planar Graph of Given Degrees
2015/08/11 by Konrad K. Dabrowski, Petr A. Golovach, Dabrowski, Konrad K. +7 · 1 citation
Biochemistry, Genetics and Molecular Biology · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Protein Degradation and Inhibitors
- What Graphs are 2-Dot Product Graphs?
2015/11/16 by Johnson, Matthew, Paulusma, Daniel, van Leeuwen, Erik Jan · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
2022/11/25 by Lozin, Vadim, Martin, Barnaby, Pandey, Sukanya +4 · 1 citation
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
2023/05/02 by Hans L. Bodlaender, Bodlaender, Hans L., Matthew Johnson +13 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory