Packing bipartite graphs with covers of complete bipartite graphs

DOI10.1016/j.dam.2012.08.026zbMath1285.05146MaRDI QIDQ2442206

Daniël Paulusma, Jérémie Chalopin

Publication date: 2 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.026

zbMATH Keywords

bipartite graph; graph factor; locally bijective homomorphism; pseudo-covering

Mathematics Subject Classification ID

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

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Star Partitions of Perfect Graphs, An algorithmic framework for locally constrained homomorphisms

Cites Work

• Locally constrained graph homomorphisms -- structure, complexity, and applications
• A complete complexity classification of the role assignment problem
• Graph factors and factorization: 1985--2003: a survey
• Covering regular graphs
• Locally constrained graph homomorphisms and equitable partitions
• The path partition problem and related problems in bipartite graphs
• On the Complexity of General Graph Factor Problems
• Graph labelings derived from models in distributed computing: A complete complexity classification
• On Restricted Two-Factors
• Constructing 5-Arc-Transitive Cubic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item