2 papers
math.CO2022
Cographs and 1-sums
Jagdeep Singh
A graph that can be generated from using joins and 0-sums is called a cograph. We define a sesquicograph to be a graph that can be generated from using joins, 0-sums, a…
math.CO2021
The smallest class of binary matroids closed under direct sums and complements
James Oxley, Jagdeep Singh
The class of cographs or complement-reducible graphs is the class of graphs that can be generated from using the operations of disjoint union and complementation. By analogy,…