A note on packing of graphic \(n\)-tuples

DOI10.1016/j.disc.2015.07.017zbMath1322.05118OpenAlexW1822789149MaRDI QIDQ501040

Jian Hua Yin

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.07.017

zbMATH Keywords

degree sequencegraphic \(n\)-tuplepacking of graphic \(n\)-tuples

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Special sequences and polynomials (11B83) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Edge disjoint placement of graphs
• A short proof of Kundu's k-factor theorem
• Contributions to the theory of graphic sequences
• The k-factor conjecture is true
• Valencies of graphs with 1-factors
• Discrete tomography and plane partitions
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Packing of graphic n-tuples
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
• Uniqueness in Discrete Tomography: Three Remarks and a Corollary
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

This page was built for publication: A note on packing of graphic \(n\)-tuples