2006/01/25 by Yaming Yu · 1 citation
Computer Science · Mathematics · Chemistry · #Advanced Graph Theory Research #Graph theory and applications #Limits and Structures in Graph Theory #Combinatorics #Mathematics #Isomorphism (crystallography) #Clique #Graph #Sequence (biology) #Discrete mathematics #Crystallography #Chemistry
paper · pdf · doi:10.37236/1033
openalex publication_date 2006/01/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
A graph is YΔ Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and YΔ Y transformations. It is still an open problem to characterize YΔ Y reducible graphs in terms of a finite set of forbidden minors. We obtain a characterization of such forbidden minors that can be written as clique k-sums for k=1, 2, 3. As a result we show constructively that the total number of forbidden minors is more than 68 billion up to isomorphism.