27 citations · 38 across the 13 of their papers we have counts for
5 papers · 1 filter
The Normal Domination Partizan Game in Stars
João Marcos Brito, Edileudo M. Moreira Filho, Jefter G. M. Paz +1
The Domination game is an impartial game on graphs, introduced in 2010, and proved PSPACE-complete in the normal variant in 2026. In this game, Alice and Bob alternately select pla…
The general position avoidance game and hardness of general position games
Ullas Chandran S. V., Sandi Klavzar, Neethu P. K. +1
Given a graph , a set of vertices in is a general position set if no triple of vertices from lie on a common shortest path in . The general position achievement/a…
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
Fabricio S. Benevides, Carlos Hoppen, Rudini Menezes Sampaio
Given a graph and an integer , a partition of the edge set of into at most classes, and a graph , define as the number…
Limits of permutation sequences through permutation regularity
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Tamm de Araújo Moreira +1
A permutation sequence is said to be convergent if, for every fixed permutation , the density of occurrences of in the elements of the sequence co…
Limits of permutation sequences
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo Moreira +2
A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent…