vix.ing · top · new · best · stats

Covering graphs with few complete bipartite subgraphs

2009/01/10 by Herbert Fleischner, Egbert Mujuni, Daniël Paulusma +1 · 31 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Bipartite graph #Combinatorics #Complete bipartite graph #Discrete mathematics #Disjoint sets #Edge cover #Graph #Limits and Structures in Graph Theory #Mathematics #Parameterized complexity #Partition (number theory) #Time complexity #Vertex (graph theory) #Vertex cover #graph theory and CDMA systems

paper · pdf · doi:10.1016/j.tcs.2008.12.059

published in Theoretical Computer Science 410(21-23), 2045-2053 (Elsevier BV)

openalex publication_date 2009/01/10 · crossref created 2009/01/10 · crossref issued 2009/05/01 · crossref published 2009/05/01 · crossref published-print 2009/05/01 · crossref deposited 2019/05/17 · openalex created_date 2025/10/10 · crossref indexed 2026/02/21 · openalex updated_date 2026/08/08

Citations

Cited by