Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 103 graphs that are irreducible for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating subgraphs in k-trees: Cables and caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu Hadwigers Vermutung / rank
 
Normal rank

Revision as of 14:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Minimal acyclic forbidden minors for the family of graphs with bounded path-width
scientific article

    Statements

    Minimal acyclic forbidden minors for the family of graphs with bounded path-width (English)
    0 references
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    The authors characterize the minimal acyclic forbidden minors for the families \(F_ k\) and \(P_ k\) of graphs with path-width and proper path- width, respectively, at most \(k\). They also give estimates for the number of minimal forbidden minors for \(F_ k\) and \(P_ k\) and for the number of vertices in the largest minimal forbidden minors for \(F_ k\) and \(P_ k\).
    0 references
    forbidden minors
    0 references
    path-width
    0 references
    0 references

    Identifiers