5 citations · 6 across the 7 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2025
Twin-width one
Jungho Ahn, Hugo Jacob, Noleen Köhler +3
We investigate the structure of graphs of twin-width at most , and obtain the following results: - Graphs of twin-width at most are permutation graphs. In particular they ha…
cs.DM2023
Odd Chromatic Number of Graph Classes
Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler +1
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, o…
cs.DM2020★ 1 cited
An explicit construction of graphs of bounded degree that are far from being Hamiltonian
Isolde Adler, Noleen Köhler
Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonia…