Carsten Thomassen
- Graph decomposition with applications to subdivisions and path systems modulo k
1983/06/01 by Carsten Thomassen · 12 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Universality in minor-closed graph classes
2021/09/01 by Tony Huynh, Bojan Mohar, Huynh, Tony +7 · 3 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
- The maximum number of minimal codewords in long codes
2012/01/29 by Adel Alahmadi, R. E. L. Aldred, Alahmadi, Adel +7 · 1 citation
Computer Science · Engineering · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #cs.IT #graph theory and CDMA systems #math.CO #math.IT #msc:05B35 #msc:05C38 #msc:94A10
- The maximum number of minimal codewords in an [n,k]-code
2012/03/04 by Adel Alahmadi, A. Alahmadi, R. E. L. Aldred +11 · 1 citation
Computer Science · Engineering · Mathematics · #05B35 (Secondary) #94A10 (Primary) 05C38 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.CO #math.IT #msc:05B35 #msc:05C38 #msc:94A10
- The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
2026/03/25 by Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita +3 · 2 voices
Computer Science · Mathematics · #math.CO #cs.CG #cs.DM #cs.DS
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
1997/06/01 by Carsten Thomassen · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Interconnection Networks and Systems #graph theory and CDMA systems