The following pages link to Packing of graphic n-tuples (Q2888877):
Displayed 15 items.
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- A note on packing of graphic \(n\)-tuples (Q501040) (← links)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- A degree sequence variant of graph Ramsey numbers (Q742597) (← links)
- A new lower bound on the potential-Ramsey number of two graphs (Q2025212) (← links)
- Packing tree degree sequences (Q2175807) (← links)
- Half-regular factorizations of the complete bipartite graph (Q2399287) (← links)
- Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- Stability of the Potential Function (Q4684741) (← links)
- Multi-switch: A tool for finding potential edge-disjoint 1-factors (Q4958048) (← links)
- A further result on the potential-Ramsey number of G1 and G2 (Q5080786) (← links)
- The potential-Ramsey number of $K_n$ and $K_t^{-k}$ (Q5084258) (← links)
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem (Q6142661) (← links)