Packing of graphic n-tuples

DOI10.1002/jgt.20598zbMath1243.05191MaRDI 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-factor; degree sequence; graphic sequence; graph packing; \(k\)-factor

Mathematics Subject Classification ID

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

05C07: Vertex degrees

Related Items

Stability of the Potential Function, Colour degree matrices of graphs with at most one cycle, New results on degree sequences of uniform hypergraphs, A note on packing of graphic \(n\)-tuples, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, A degree sequence variant of graph Ramsey numbers, Half-regular factorizations of the complete bipartite graph, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

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