4 papers · 1 filter
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}…
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…