From the 1 of 16 linked papers with an AI index.
16 papers
Coloring semiminimal Cayley Graphs
Ignacio GarcÃa-Marco, Kolja Knauer, Giuliamaria Menara
The paper proves that semiminimal Cayley graphs of abelian and generalized dihedral groups have circular chromatic number at most 4, extending earlier results and addressing a ques…
Embracing exchange sequences and oriented matroid polyhedron diameter
Kolja Knauer, Luis Pedro Montejano
We reduce the embracing exchange distance of bases of oriented matroids to the metric of oriented matroid polyhedra. This allows us to disprove recent conjectures of Caoduro, Khoda…
Cell structure of mediangle graphs
Victor Chepoi, Anthony Genevois, Kolja Knauer
Mediangle graphs are a common generalization of median graphs (1-sekeleta of CAT(0) cube complexes) and Coxeter graphs (Cayley graphs of Coxeter systems). Answering a question moti…
Clustered independence and bounded treewidth
Kolja Knauer, Torsten Ueckerdt
A set of vertices of a graph is a -clustered set if it induces a subgraph with components of order at most each, and denotes the size of a large…
Sensitivity and Hamming graphs
Sara Asensio, Yuval Filmus, Ignacio GarcÃa-Marco +1
For any we show that the Hamming graph admits an imbalanced partition into sets, each inducing a subgraph of low maximum degree. This improves previous resul…
Odd coloring graphs with linear neighborhood complexity
James Davies, Meike Hatzel, Kolja Knauer +2
We prove that any class of graphs with linear neighborhood complexity has bounded improper odd chromatic number. As a result, if is the class of all circle graphs, or…