On the ascending subgraph decomposition problem for bipartite graphs

DOI10.1016/j.endm.2014.08.004zbMath1338.05206OpenAlexW2014008300MaRDI QIDQ283657

S. Slamin, Anna S. Lladó, Josep M. Aroca

Publication date: 13 May 2016

Full work available at URL: http://hdl.handle.net/2117/26088

zbMATH Keywords

ascending subgraph decompositionsumset partition problem

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Distinct edge geodetic decomposition in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the modular sumset partition problem
• A note on the ascending subgraph decomposition problem
• Disjoint subsets of integers having a constant sum
• On the ascending subgraph decompositions of regular graphs
• On the ascending star subgraphs decomposition of star forests
• Ascending subgraph decompositions of regular graphs
• A note on ascending subgraph decompositions of complete multipartite graphs
• Partition of a set of integers into subsets with prescribed sums
• Restricted Edge-colourings of Bipartite Graphs
• Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs