Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2017.08.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a countable clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relative of Hadwiger's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Planar Graphs With Three Colours and No Large Monochromatic Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game of Hex and the Brouwer Fixed-Point Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the odd-minor variant of Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed Hadwiger's conjecture for list colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IX: Disjoint crossed paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIV: Extending an embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partition-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and the Hadwiger conjecture / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2017.08.003 / rank
 
Normal rank

Latest revision as of 03:07, 11 December 2024

scientific article; zbMATH DE number 6813545
Language Label Description Also known as
English
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
scientific article; zbMATH DE number 6813545

    Statements

    Partitioning \(H\)-minor free graphs into three subgraphs with no large components (English)
    0 references
    0 references
    0 references
    28 November 2017
    0 references
    vertex partitions
    0 references
    graph minors
    0 references
    odd minors
    0 references
    small components
    0 references

    Identifiers