4 citations · 10 across the 14 of their papers we have counts for
15 papers
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…
Most direct product of graphs are Type 1
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Kowada +2
A \textit{-total coloring} of a graph is an assignment of colors to its elements (vertices and edges) so that adjacent or incident elements have different colors. The to…
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…
The fundamental group of an algebra with strongly simply connected Galois covering
Claudia Chaio, Diane Castonguay, Sonia Trepode
In this work, we prove that if a triangular algebra admits a strongly simply connected universal Galois covering for a given presentation then the fundamental group associated…
Results for the maximum weight planar subgraph problem
Diane Castonguay, Elisângela Silva Dias, Leslie Richard Foulds
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, syst…
(m,n)-Quasitilted and (m,n)-Almost Hereditary Algebras
Diane Castonguay, Edson Ribeiro Alvares, Patrick Le Meur +1
Motivated by the study of (m,n)-quasitilted algebras, which are the piecewise hereditary algebras obtained from quasitilted algebras of global dimension two by a sequence of (co)ti…