3 papers
math.CO2026
Bounds on the game isolation number and exact values for paths and cycles
Csilla Bujtás, Tanja Dravec, Michael A. Henning +1
The isolation game is played on a graph by two players who take turns playing a vertex such that if is the set of already played vertices, then a vertex can be selected onl…
math.CO2026
S-packing chromatic critical paths and cycles
Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1
Let be a non-decreasing sequence of positive integers. For a graph with vertex set , a labeling is an -packing $…
math.CO2026
Independent mutual-visibility sets and distance edge-critical graphs
Jing Tian, Csilla Bujtás, Sandi Klavžar
In this paper, connections between independent sets and the variety of mutual-visibility sets are studied. It is proved that every outer mutual-visibility set of a graph is indepen…