24 citations · 94 across the 38 of their papers we have counts for
5 papers · 2 filters
Cuts in matchings of 3-connected cubic graphs
Kolja Knauer, Petru Valicov
We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs…
Decomposing -connected planar triangulations into two trees and one path
Kolja Knauer, Torsten Ueckerdt
Refining a classical proof of Whitney, we show that any -connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every -connected p…
Chomp on numerical semigroups
Ignacio García-Marco, Kolja Knauer
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of…
On lattice path matroid polytopes: integer points and Ehrhart polynomial
Kolja Knauer, Leonardo Martínez-Sandoval, Jorge Luis Ramírez Alfonsín
In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the…
On tope graphs of complexes of oriented matroids
Kolja Knauer, Tilen Marc
We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all an…