Packing of graphic n-tuples (Q2888877): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20598 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1549220516 / 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: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: On factorable degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank

Latest revision as of 07:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Packing of graphic n-tuples
scientific article

    Statements

    Packing of graphic n-tuples (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2012
    0 references
    0 references
    degree sequence
    0 references
    graphic sequence
    0 references
    graph packing
    0 references
    \(k\)-factor
    0 references
    1-factor
    0 references
    0 references