Pages that link to "Item:Q2461771"

The following pages link to Perfect packings with complete graphs minus an edge (Q2461771):

Displaying 8 items.

• Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
• The minimum degree threshold for perfect graph packings (Q2149489) (← links)
• The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
• Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
• The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← links)
• \(H\)-factors in graphs with small independence number (Q6615761) (← links)