A proof of the Barát-Thomassen conjecture (Q1989951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Claw‐decompositions and tutte‐orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decomposition of graphs into copies of a tree with four edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decompositions of graphs with high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing highly connected graphs into paths of length five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing highly edge-connected graphs into paths of any given length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 3-flows and modulo \(k\)-orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration for Independent Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of highly connected graphs into paths of length 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decompositions of highly connected graphs into paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak 3-flow conjecture and the weak circular flow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs into paths of fixed length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into bistars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083463 / rank
 
Normal rank

Latest revision as of 02:43, 17 July 2024

scientific article
Language Label Description Also known as
English
A proof of the Barát-Thomassen conjecture
scientific article

    Statements

    A proof of the Barát-Thomassen conjecture (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2018
    0 references
    tree-decomposition
    0 references
    large edge-connectivity
    0 references
    Barát-Thomassen conjecture
    0 references

    Identifiers

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