1 citations · 1 across the 5 of their papers we have counts for
6 papers
Trail Trap: a variant of Partizan Edge Geography
Calum Buchanan, MacKenzie Carr, Alexander Clifton +4
We study a two-player game played on undirected graphs called {\sc Trail Trap}, which is a variant of a game known as {\sc Partizan Edge Geography}. One player starts by choosing a…
Eulerian Polynomials for Digraphs
Kyle Celano, Nicholas Sieger, Sam Spiro
Given an -vertex digraph and a labeling , we say that an arc of is a descent of if . Foata and Zeilberger introduced a generating…
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Michael Levet, Puck Rombach, Nicholas Sieger
In this paper, we show that computing canonical labelings of graphs of bounded rank-width is in . Our approach builds on the framework of Köbler & Verbitsky (CSR 2…
Logarithmic Weisfeiler--Leman and Treewidth
Michael Levet, Puck Rombach, Nicholas Sieger
In this paper, we show that the -dimensional Weisfeiler--Leman algorithm can identify graphs of treewidth in rounds. This improves the result of Grohe & Ver…
Quasi-Random Influences of Boolean Functions
Fan Chung, Nicholas Sieger
We examine a hierarchy of equivalence classes of quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balan…
Maximal Planar Subgraphs of Fixed Girth in Random Graphs
Manuel Fernández, Nicholas Sieger, Michael Tait
In 1991, Bollobás and Frieze showed that the threshold for to contain a spanning maximal planar subgraph is very close to . In this paper, we compute simila…