2 citations · 3 across the 2 of their papers we have counts for
5 papers · 1 filter
On the interval coloring impropriety of graphs
MacKenzie Carr, Eun-Kyung Cho, Nicholas Crawford +3
An improper interval (edge) coloring of a graph is an assignment of colors to the edges of satisfying the condition that, for every vertex , the set of colors a…
Fibonacci-run graphs II: Degree sequences
Ömer Eğecioğlu, Vesna Iršič
Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs h…
Fibonacci-run graphs I: basic properties
Ömer Eğecioğlu, Vesna Iršič
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex s…
Connected domination game: predomination, Staller-start game, and lexicographic products
Vesna Iršič
The connected domination game was recently introduced by Borowiecki, Fiedorowicz and Sidorowicz as another variation of the domination game. The rules are essentially the same, exc…
Strong geodetic problem on Cartesian products of graphs
Vesna Iršič, Sandi Klavžar
The strong geodetic problem is a recent variation of the geodetic problem. For a graph , its strong geodetic number is the cardinality of a smallest vertex subset…