1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
Filling some gaps on the edge coloring problem of split graphs
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph is said to be -admissible if admits a spanning tree in w…
math.CO2023
New Results on Edge-coloring and Total-coloring of Split Graphs
Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein
A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph is said to be -admissible if admits a special spanning t…
cs.DM2022★ 1 cited
Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs
Fernanda Couto, Luís Cunha, Diego Ferraz
A tree -spanner of a graph is a spanning tree in which the distance between any two adjacent vertices of is at most . The smallest for which has a tree $t…