A note on packing of graphic n-tuples

DOI10.1016/J.DISC.2015.07.017zbMATH Open1322.05118OpenAlexW1822789149MaRDI QIDQ501040FDOQ501040

Authors: 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

Recommendations

• Packing of graphic \(n\)-tuples
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A near packing of two graphs
• On a packing problem of Alon and Yuster
• On a graph packing conjecture by Bollobás, Eldridge and Catlin

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• 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
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
• Title not available (Why is that?)
• Edge disjoint placement of graphs
• Packing of graphic \(n\)-tuples
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Contributions to the theory of graphic sequences
• A short proof of Kundu's k-factor theorem
• The k-factor conjecture is true
• Valencies of graphs with 1-factors
• Discrete tomography and plane partitions
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

Cited In (3)

• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• Title not available (Why is that?)
• Packing of graphic \(n\)-tuples

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501040)