Covering Graphs with Few Complete Bipartite Subgraphs

DOI10.1007/978-3-540-77050-3_28zbMath1135.68439OpenAlexW4239226376MaRDI QIDQ5458846

Egbert Mujuni, Daniël Paulusma, Stefan Szeider, Herbert Fleischner

Publication date: 24 April 2008

Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Complexity of list coloring problems with a fixed total number of colors
• On edge perfectness and classes of bipartite graphs
• Chromatic characterization of biclique covers
• Parametrized complexity theory.
• FindingH-partitions efficiently
• Computational Complexity of Compaction to Reflexive Cycles
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

This page was built for publication: Covering Graphs with Few Complete Bipartite Subgraphs