Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1835438265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best monotone degree conditions for graph properties: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(d\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sequence variant of graph Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphic n-tuples / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / 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: Chromatic number and complete graph substructures for degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic / 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: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the existence of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph packing conjecture by Bollobás, Eldridge and Catlin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656238 / 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: Q3941440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger number and chromatic number for near regular degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs - a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:27, 11 July 2024

scientific article
Language Label Description Also known as
English
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
scientific article

    Statements

    Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 October 2015
    0 references
    degree sequence
    0 references
    discrete tomography
    0 references
    packing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references