A note on packing of graphic \(n\)-tuples (Q501040): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Packing of graphic n-tuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Kundu's k-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography and plane partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness in Discrete Tomography: Three Remarks and a Corollary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k-factor conjecture is true / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valencies of graphs with 1-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of graphic sequences / rank
 
Normal rank

Revision as of 20:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A note on packing of graphic \(n\)-tuples
scientific article

    Statements

    Identifiers