Packing minor closed families of graphs (Q322346): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6639430 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph packing
Property / zbMATH Keywords: graph packing / rank
 
Normal rank
Property / zbMATH Keywords
 
minor closed families
Property / zbMATH Keywords: minor closed families / rank
 
Normal rank
Property / zbMATH Keywords
 
resolvable designs
Property / zbMATH Keywords: resolvable designs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2015.06.088 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180330891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181380 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:27, 12 July 2024

scientific article
Language Label Description Also known as
English
Packing minor closed families of graphs
scientific article

    Statements

    Packing minor closed families of graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    graph packing
    0 references
    minor closed families
    0 references
    resolvable designs
    0 references

    Identifiers