Closed trail decompositions of complete equipartite graphs (Q3578148): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jcd.20228 / rank
Normal rank
 
Property / author
 
Property / author: Andrea C. Burgess / rank
Normal rank
 
Property / author
 
Property / author: Andrea C. Burgess / 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.1002/jcd.20228 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108238762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Digraphs with Directed Closed Trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Circuits into <i>K</i><sub><i>N</i></sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete tripartite graphs into closed trails of arbitrary lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum packings of uniform group divisible triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge partitions of complete multipartite graphs into equal length circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced incomplete block designs and related designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Existence and Construction of Balanced Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Complete Bipartite Even Graphs into Closed Trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartite Oberwolfach problem with uniform tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another class of balanced graph designs: Balanced circuit designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing \(K_n -I\) into cycles of a fixed odd length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into closed trails of length \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete equipartite graphs into cycles of length2p / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal consistent families of triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JCD.20228 / rank
 
Normal rank

Latest revision as of 12:26, 21 December 2024

scientific article
Language Label Description Also known as
English
Closed trail decompositions of complete equipartite graphs
scientific article

    Statements

    Closed trail decompositions of complete equipartite graphs (English)
    0 references
    0 references
    0 references
    13 July 2010
    0 references
    complete multipartite graph
    0 references
    decomposition
    0 references
    closed trail
    0 references

    Identifiers