3 papers
math.CO2023
Large Matchings in Maximal 1-planar graphs
Therese Biedl, John Wittnebel
It is well-known that every maximal planar graph has a matching of size at least if . In this paper, we investigate similar matching-bounds for maximal \…
cs.DM2019
Matchings in 1-planar graphs with large minimum degree
Therese Biedl, John Wittnebel
In 1979, Nishizeki and Baybars showed that every planar graph with minimum degree 3 has a matching of size (where the constant depends on the connectivity), and…
cs.FL2016
Syntactic complexity of bifix-free languages
Marek Szykuła, John Wittnebel
We study the properties of syntactic monoids of bifix-free regular languages. In particular, we solve an open problem concerning syntactic complexity: We prove that the cardinality…