Ana Silva

activity

20162021

collaborators

6 papers

cs.DM2021

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 $G$ at least (resp. exactly) once. This notion was first discussed by Leonhard Euler…

cs.CC2020

A Unifying Model for Locally Constrained Spanning Tree Problems

Luiz Alberto do Carmo Viana, Manoel Campêlo, Ignasi Sau +1

Given a graph $G$ and a digraph $D$ whose vertices are the edges of $G$ , we investigate the problem of finding a spanning tree of $G$ that satisfies the constraints imposed by $D$ .…

cs.DS2020

Edge-Disjoint Branchings in Temporal Graphs

Victor Campos, Raul Lopes, Andrea Marino +1

A temporal digraph $G$ is a triple $(G, γ, λ)$ where $G$ is a digraph, $γ$ is a function on $V (G)$ that tells us the timestamps when a vertex is active, and $λ$ is a functio…

cs.DM2019

On Orthogonal Vector Edge Coloring

Ana Silva, Allen Ibiapina

Given a graph $G$ and a positive integer $d$ , an orthogonal vector $d$ -coloring of $G$ is an assignment $f$ of vectors of $R^{d}$ to $V (G)$ in such a way that adjacent verti…

cs.DM2019

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 $G$ is the set $S_{b}…

cs.DM2016

Circular Backbone Colorings: on matching and tree backbones of planar graphs

Julio Araujo, Fabricio Benevides, Alexandre Cezar +1

Given a graph $G$ , and a spanning subgraph $H$ of $G$ , a circular $q$ -backbone $k$ -coloring of $(G, H)$ is a proper $k$ -coloring $c$ of $G$ such that $q\le \lvert c(u)-c(v)\rvert \l…