On tree-partition-width (Q1024321): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0602507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domino Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-partitions of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836521 / 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: On tree-partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient tree partitioning of undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinct distances in graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing straight-line 3D grid drawings of graphs in linear volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawings with few slopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar decompositions and the crossing number of graphs with an excluded minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on nonrepetitive graph colouring / 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: Logical aspects of Cayley-graphs: the group case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding uniform emulations on fixed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding uniform emulations on paths and ring networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of large networks on smaller networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quotient Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional colouring and Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank

Latest revision as of 16:45, 1 July 2024

scientific article
Language Label Description Also known as
English
On tree-partition-width
scientific article

    Statements

    On tree-partition-width (English)
    0 references
    0 references
    17 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    tree partition
    0 references
    tree partition width
    0 references
    0 references
    0 references