Barnaby Martin

1. The packing chromatic number of the infinite square lattice is between\n 13 and 15
   2015/10/08 by Barnaby Martin, Martin, Barnaby, Franco Raimondi +5 · 2 citations
   Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory
2. Disjoint Paths and Connected Subgraphs for H-Free Graphs
   2021/05/13 by Walter Kern, Kern, Walter, Barnaby Martin +7 · 2 citations
   Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #graph theory and CDMA systems
3. Proof complexity and the binary encoding of combinatorial principles
   2020/08/04 by Stefan Dantchev, Nicola Galesi, Dantchev, Stefan +5 · 1 citation
   Computer Science · Mathematics · #Advanced Algebra and Logic #Benford’s Law and Fraud Detection #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #semigroups and automata theory
4. Colouring Graphs of Bounded Diameter in the Absence of Small Cycles
   2021/01/19 by Barnaby Martin, Daniël Paulusma, Martin, Barnaby +3 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
5. 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