
TriangleFree Penny Graphs: Degeneracy, Choosability, and Edge Count
We show that trianglefree penny graphs have degeneracy at most two, lis...
read it

Proper Orientation Number of Trianglefree Bridgeless Outerplanar Graphs
An orientation of G is a digraph obtained from G by replacing each edge ...
read it

Blocking dominating sets for Hfree graphs via edge contractions
In this paper, we consider the following problem: given a connected grap...
read it

On the Classification of Motions of Paradoxically Movable Graphs
Edge lengths of a graph are called flexible if there exist infinitely ma...
read it

Decision problems for Clarkcongruential languages
A common question when studying a class of contextfree grammars is whet...
read it

Escaping an Infinitude of Lions
We consider the following game played in the Euclidean plane: There is a...
read it

Edge minimization in de Bruijn graphs
This paper introduces the de Bruijn graph edge minimization problem, whi...
read it
On Vizing's edge colouring question
Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a series of Kempe changes? We answer this question in the affirmative for trianglefree graphs.
READ FULL TEXT
Comments
There are no comments yet.