Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences (Q4906045): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q354460
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: M. Amin Bahmanian / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3123713780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.03847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized latin rectangles I: Construction and decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized latin rectangles. II: Embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-coloring of complete hypergraphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly edge-connected detachments of graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of connected \(k\)-factorizations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete regular s-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of factorizations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of r-partite graphs into edge-disjoint Hamilton circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of complete multipartite graphs with any 2‐factor leave / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of complete graphs with a 3-factor leave. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Detachments of Graphs and Generalized Euler Trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of almost regular edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5761487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding edge‐colorings into 2‐edge‐connected <i>k</i>‐factorizations of <i>k<sub>kn+1</sub></i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Particular Conference Scheduling Problem / rank
 
Normal rank

Latest revision as of 04:43, 6 July 2024

scientific article; zbMATH DE number 6137926
Language Label Description Also known as
English
Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
scientific article; zbMATH DE number 6137926

    Statements

    Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences (English)
    0 references
    21 February 2013
    0 references
    amalgamations
    0 references
    detachments
    0 references
    3-uniform hypergraphs
    0 references
    laminar families
    0 references
    factorization
    0 references
    decomposition
    0 references
    0 references

    Identifiers