Bart Litjens

activity

20162019

most citedSemidefinite bounds for nonbinary codes based on quadruples

26 citations · 50 across the 7 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 2 cited

Sum-perfect graphs

Bart Litjens, Sven Polak, Vaidy Sivaraman

Inspired by a famous characterization of perfect graphs due to Lovász, we define a graph $G$ to be sum-perfect if for every induced subgraph $H$ of $G$ , $α (H) + ω (H) \geq ∣ V (H) ∣$ .…

math.CO2017★ 4 cited

On dihedral flows in embedded graphs

Bart Litjens

Let $Γ$ be a multigraph with for each vertex a cyclic order of the edges incident with it. For $n \geq 3$ , let $D_{2 n}$ be the dihedral group of order $2 n$ . Define $\mathbb{D} := \…

math.CO2017★ 2 cited

Partition functions and a generalized coloring-flow duality for embedded graphs

Bart Litjens, Bart Sevenster

Let $G$ be a finite group and $χ : G \to C$ a class function. Let $H = (V, E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. T…