J. Chalopin
Packing bipartite graphs with covers of complete bipartite graphs
Chalopin, J.; Paulusma, D.
Abstract
For a set SS of graphs, a perfect SS-packing (SS-factor) of a graph GG is a set of mutually vertex-disjoint subgraphs of GG that each are isomorphic to a member of SS and that together contain all vertices of GG. If GG allows a covering (locally bijective homomorphism) to a graph HH, i.e., a vertex mapping f:VG→VHf:VG→VH satisfying the property that f(u)f(v)f(u)f(v) belongs to EHEH whenever the edge uvuv belongs to EGEG such that for every u∈VGu∈VG the restriction of ff to the neighborhood of uu is bijective, then GG is an HH-cover. For some fixed HH let S(H)S(H) consist of all connected HH-covers. Let Kk,ℓKk,ℓ be the complete bipartite graph with partition classes of size kk and ℓℓ, respectively. For all fixed k,ℓ≥1k,ℓ≥1, we determine the computational complexity of the problem that tests whether a given bipartite graph has a perfect S(Kk,ℓ)S(Kk,ℓ)-packing. Our technique is partially based on exploring a close relationship to pseudo-coverings. A pseudo-covering from a graph GG to a graph HH is a homomorphism from GG to HH that becomes a covering to HH when restricted to a spanning subgraph of GG. We settle the computational complexity of the problem that asks whether a graph allows a pseudo-covering to Kk,ℓKk,ℓ for all fixed k,ℓ≥1k,ℓ≥1.
Citation
Chalopin, J., & Paulusma, D. (2014). Packing bipartite graphs with covers of complete bipartite graphs. Discrete Applied Mathematics, 168, 40-50. https://doi.org/10.1016/j.dam.2012.08.026
Journal Article Type | Article |
---|---|
Publication Date | May 1, 2014 |
Deposit Date | Mar 11, 2013 |
Publicly Available Date | Apr 17, 2013 |
Journal | Discrete Applied Mathematics |
Print ISSN | 0166-218X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 168 |
Pages | 40-50 |
DOI | https://doi.org/10.1016/j.dam.2012.08.026 |
Keywords | Bipartite graph, Graph factor, Locally bijective homomorphism, Pseudo-covering. |
Public URL | https://durham-repository.worktribe.com/output/1487695 |
Files
Accepted Journal Article
(884 Kb)
PDF
Published Journal Article
(394 Kb)
PDF
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search