A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
The author gives an O(\(\Delta| E|)\) algorithm (\(\Delta\) denotes the maximum degree) for the construction of edge maximal subgraph G' of a given graph G with the property that there exists an edge 2-coloring of G' such that one color induces a triangulated subgraph of G' while the complementary color induces a subgraph of G' without triangles. These researches have applications in maximum clique finding enumerative algorithms.
scientific article; zbMATH DE number 4029609