1 citations · 1 across the 11 of their papers we have counts for
8 papers · 1 filter
Snapshot disjointness in temporal graphs
Allen Ibiapina, Ana Silva
In the study of temporal graphs, only paths respecting the flow of time are relevant. In this context, many concepts of walks disjointness were proposed over the years, and the val…
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
Andrea Marino, Ana Silva
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph at least (resp. exactly) once. This notion was first discussed by Leonhard Euler…
On Orthogonal Vector Edge Coloring
Ana Silva, Allen Ibiapina
Given a graph and a positive integer , an orthogonal vector -coloring of is an assignment of vectors of to in such a way that adjacent verti…
b-continuity and Partial Grundy Coloring of graphs with large girth
Allen Ibiapina, Ana Silva
A b-coloring of a graph is a proper coloring such that each color class has at least one vertex which is adjacent to each other color class. The b-spectrum of is the set $S_{b}…
On the b-continuity of the lexicographic product of graphs
Cláudia Linhares Sales, Leonardo Sampaio, Ana Silva
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of is…
Circular Backbone Colorings: on matching and tree backbones of planar graphs
Julio Araujo, Fabricio Benevides, Alexandre Cezar +1
Given a graph , and a spanning subgraph of , a circular -backbone -coloring of is a proper -coloring of such that $q\le \lvert c(u)-c(v)\rvert \l…
Edge-b-coloring Trees
Victor Campos, Ana Silva
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to at least one vertex in each other color class. The b-chro…
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring
Julio Araujo, Alexandre A. Cezar, Ana Silva
A proper -coloring of a graph is a function such that , for every . The chromatic number is the minimum $…