Minimum weight H-decompositions of graphs: the bipartite case

zbMATH Open1330.05134MaRDI QIDQ547786FDOQ547786

Authors: Teresa Sousa 

Publication date: 24 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p126.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Minimum \(H\)-decompositions of graphs
• Bipartite subgraphs of integer weighted graphs
• The decomposition threshold for bipartite graphs with minimum degree one
• \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
• Decomposing weighted graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• The decomposition threshold for bipartite graphs with minimum degree one
• Minimum \(H\)-decompositions of graphs
• Title not available (Why is that?)

This page was built for publication: Minimum weight \(H\)-decompositions of graphs: the bipartite case

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