Pages that link to "Item:Q458446"

The following pages link to Combinatorial and computational aspects of graph packing and graph decomposition (Q458446):

Displaying 27 items.

• A survey on Hamilton cycles in directed graphs (Q412269) (← links)
• On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs (Q423977) (← links)
• Vertex-disjoint cycles in regular tournaments (Q427838) (← links)
• Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
• Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
• Transitive triangle tilings in oriented graphs (Q1989953) (← links)
• On asymptotic packing of geometric graphs (Q2081476) (← links)
• On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
• A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
• On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Packing degenerate graphs (Q2324574) (← links)
• Cyclic triangle factors in regular tournaments (Q2335694) (← links)
• \(F\)-factors in hypergraphs via absorption (Q2345534) (← links)
• A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
• Edge decompositions and rooted packings of graphs (Q2675822) (← links)
• Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
• Network-Based Dissolution (Q2922597) (← links)
• The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
• Star Partitions of Perfect Graphs (Q5167740) (← links)
• Structural Properties of Sparse Graphs (Q5301017) (← links)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
• Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
• On asymptotic packing of convex geometric and ordered graphs (Q6062874) (← links)
• Vertex‐disjoint cycles of the same length in tournaments (Q6094042) (← links)
• Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
• Packing \(K_r\)s in bounded degree graphs (Q6497939) (← links)