activity
20222024
most citedSimpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

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…