1 citations · 1 across the 6 of their papers we have counts for
6 papers
Separating path systems for cubic graphs and for complete bipartite graphs
Cristina Fernandes, Carlos Hoppen, George Kontogeorgiou +2
A strongly separating path system in a graph is a collection of paths in such that, for every two edges and of , there is a paths in …
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
Fábio Botler, Cristina G. Fernandes, Carla N. Lintzmayer +4
An immersion of a graph in a graph is a minimal subgraph of for which there is an injection and a set of edge-disjoint paths $\{P_e:…
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
F. Botler, Y. S. Couto, C. G. Fernandes +4
Chernyshev, Rauch, and Rautenbach proved that every connected graph on vertices with less than edges has a vertex cut that induces a forest, and co…
A study on token digraphs
Cristina G. Fernandes, Carla N. Lintzmayer, Juan P. Peña +3
For a digraph of order and an integer , the -token digraph of is the graph whose vertices are all -subsets of vertices of and, given two su…
Packing large balanced trees into bipartite graphs
Cristina G. Fernandes, Tássio Naia, Giovanne Santos +1
We prove that for every there exists such that for every any family of up to trees having at most $(1-γ…
Separating path systems in complete graphs
Cristina G. Fernandes, Guilherme Oliveira Mota, Nicolás Sanhueza-Matamala
We prove that in any -vertex complete graph there is a collection of paths that strongly separates any pair of distinct edges , meaning that th…