3 citations · 5 across the 7 of their papers we have counts for
8 papers
Greedy approaches for Gold Grabbing on subclasses of split graphs
Heitor Melo de Lucas Brandão, Hebert Coelho da Silva, Julliano Rosa Nascimento
The Gold Grabbing Game is a combinatorial game on vertex-weighted graphs in which two players alternately remove vertices while maintaining graph connectivity, aiming to maximize t…
Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
Bijo S. Anand, Ullas Chandran S. V., Julliano R. Nascimento +1
Let be a graph and . In the cycle convexity, we say that is \textit{cycle convex} if for any , the induced subgraph of …
Computing a 3-role assignment is polynomial-time solvable on complementary prisms
Diane Castonguay, Elisângela S. Dias, Fernanda N. Mesquita +1
A -role assignment of a simple graph is an assignment of distinct roles to the vertices of , such that two vertices with the same role have the same set of roles assi…
Perfect matching cuts partitioning a graph into complementary subgraphs
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho +2
In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph , and an edge set property , and asked whether can be decomposed into two graphs, and…
On the monophonic convexity in complementary prisms
Neethu P. K., Ullas Chandran S. V., Julliano R. Nascimento
A set of vertices of a graph is \emph{monophonic convex} if contains all the vertices belonging to any induced path connecting two vertices of . The cardinality of a…
Linear-time Algorithms for Eliminating Claws in Graphs
Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira +2
Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given grap…
A note on the convexity number for complementary prisms
Diane Castonguay, Erika M. M. Coelho, Hebert Coelho +1
In the geodetic convexity, a set of vertices of a graph is if all vertices belonging to any shortest path between two vertices of lie in . The card…
On the Geodetic Hull Number of Complementary Prisms
Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento +1
Let be a finite, simple, and undirected graph and let be a set of vertices of . In the geodetic convexity, a set of vertices of a graph is convex if all vertices…