Showing 2021Show all
2 papers · 1 filter
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,…
math.CO2021
Generalizing Cographs to 2-Cographs
James Oxley, Jagdeep Singh
A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have the 4-vertex path as an i…