Volume 32, Issue 3 (2025)

Colouring Complete Multipartite and Kneser-Type Digraphs

Ararat Harutyunyan, Gil Puig i Surroca

P3.1
- PDF
Counting Graph Orientations with No Directed Triangles

Pedro Araújo, Fábio Botler, Guilherme Oliveira Mota

P3.2
- PDF
The Complexity of the Greedoid Tutte Polynomial

Christopher Knapp, Steven Noble

P3.3
- PDF
On Subdivisions of Four Blocks Cycles with Two Non-Consecutive Blocks of Length One in Digraphs with Large Chromatic Number

Darine Al-Mniny, Soukaina Zayat

P3.4
- PDF
Forbidden Pairs for Traceability of 2-Connected Graphs

Shipeng Wang, Liming Xiong

P3.5
- PDF
Pattern-Avoiding Modified Ascent Sequences

Giulio Cerbai

P3.6
- PDF
Rainbow Common Graphs Must Be Forests

Yihang Sun

P3.7
- PDF
Characterizations of Perfectly Clustering Words

Mélodie Lapointe, Christophe Reutenauer

P3.8
- PDF
On the Fractional Matching Extendability of Cayley Graphs of Abelian Groups

Boštjan Kuzman, Primož Šparl

P3.9
- PDF
Hindrance from a Wasteful Partial Linkage

Attila Joó

P3.10
- PDF
De Bruijn Sequences: from Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem

Gal Amram, Amir Rubin, Yotam Svoray, Gera Weiss

P3.11
- PDF
Isoperimetry in Product Graphs

Sahar Diskin, Wojciech Samotij

P3.12
- PDF
Flag-Transitive Point-Primitive Quasi-Symmetric $2$-Designs and Exceptional Groups of Lie Type

Jianbing Lu

P3.13
- PDF
A Lower Bound on the Saturation Number and a Strengthening for Triangle-Free Graphs

Calum Buchanan, Puck Rombach

P3.14
- PDF
Clustered Colouring of Graph Products

Rutger Campbell, J. Pascal Gollin, Kevin Hendrey, Thomas Lesgourgues, Bojan Mohar, Youri Tamitegama, Jane Tan, David R. Wood

P3.15
- PDF
On the Number of Monochromatic Cliques in a Graph

Deepak Bal, Jonathan Cutler, Luke Pebody

P3.16
- PDF
Thin Edges in Claw-Free Bricks

Jinxin Xue, Fuliang Lu

P3.17
- PDF