The branchwidth of graphs and their cycle matroids (Q2642007): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.jctb.2006.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058685100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / 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. XI: Circuits on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 13:40, 26 June 2024

scientific article
Language Label Description Also known as
English
The branchwidth of graphs and their cycle matroids
scientific article

    Statements

    The branchwidth of graphs and their cycle matroids (English)
    0 references
    0 references
    0 references
    20 August 2007
    0 references
    0 references
    graph
    0 references
    cycle matroid
    0 references
    branch decomposition
    0 references
    tangle
    0 references
    0 references