Packing of graphic n-tuples

DOI10.1002/jgt.20598zbMath1243.05191OpenAlexW1549220516MaRDI QIDQ2888877

Hemanshu Kaul, Michael S. Jacobson, Michael Ferrara, Douglas B. West, Stephen G. Hartke, Arthur H. Busch

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20598

zbMATH Keywords

1-factordegree sequencegraphic sequencegraph packing\(k\)-factor

Mathematics Subject Classification ID

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

Related Items

Colour degree matrices of graphs with at most one cycle ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Half-regular factorizations of the complete bipartite graph ⋮ A further result on the potential-Ramsey number of G1 and G2 ⋮ The potential-Ramsey number of $K_n$ and $K_t^{-k}$ ⋮ Packing tree degree sequences ⋮ New results on degree sequences of uniform hypergraphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Constructing bounded degree graphs with prescribed degree and neighbor degree sequences ⋮ A note on packing of graphic \(n\)-tuples ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ A new lower bound on the potential-Ramsey number of two graphs ⋮ Stability of the Potential Function ⋮ Multi-switch: A tool for finding potential edge-disjoint 1-factors ⋮ A degree sequence variant of graph Ramsey numbers

Cites Work

• Edge disjoint placement of graphs
• A short proof of Kundu's k-factor theorem
• The k-factor conjecture is true
• Valencies of graphs with 1-factors
• On factorable degree sequences
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Paths, Trees, and Flowers
• Some Theorems on Abstract Graphs