Packing bipartite graphs with covers of complete bipartite graphs

DOI10.1007/978-3-642-13073-1_25zbMATH Open1284.05273OpenAlexW1480337396MaRDI QIDQ3563009FDOQ3563009

Authors: J. Chalopin, Daniël Paulusma 

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/10699/1/10699.pdf

Recommendations

• Packing bipartite graphs with covers of complete bipartite graphs
• scientific article
• Packings by Complete Bipartite Graphs
• Covering graphs with few complete bipartite subgraphs
• The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Graph labelings derived from models in distributed computing: A complete complexity classification
• Title not available (Why is that?)
• Packings and Coverings of the Complete Bipartite Graph by Octagons
• Title not available (Why is that?)

This page was built for publication: Packing bipartite graphs with covers of complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563009)