The proper conflict-free chromatic number, χ_pcf(G), of a graph G is
the...
J.-P. Roudneff conjectured in 1991 that every arrangement of n ≥ 2d+1≥
5...
A set S⊆ V of vertices of a graph G is a c-clustered set
if it induces a...
Let X be a finite set. A family P of subsets of X is called a convex
geo...
We characterize the quotients among lattice path matroids (LPMs) in term...
A graph is a core or unretractive if all its endomorphisms are automorph...
We study the minimum size f of a feedback vertex set in directed and
und...
We show that the topes of a complex of oriented matroids (abbreviated CO...
We investigate Cayley graphs of finite semigroups and monoids. First, we...
In this paper, we give bounds on the dichromatic number χ⃗(Σ)
of a surfa...
Huang proved that every set of more than half the vertices of the
d-dime...
This paper considers completions of COMs (complexes oriented matroids) t...
Planar bipartite graphs can be represented as touching graphs of horizon...
We give simple algorithms to enumerate the α-orientations of a graph
G i...
It was recently pointed out that certain SiO_2 layer structures and SiO_...
We investigate the structure of two-dimensional partial cubes, i.e., of
...
Flip graphs are a ubiquitous class of graphs, which encode relations ind...
Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
Heath and Pemmaraju conjectured that the queue-number of a poset is boun...
The interval number of a graph G is the minimum k such that one can
assi...
We discuss relations between several known (some false, some open)
conje...
We prove that, given a closure function the smallest preimage of a close...
Refining a classical proof of Whitney, we show that any 4-connected plan...