Graph minors. IX: Disjoint crossed paths (Q1813957): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(90)90063-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061980451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency in binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank

Latest revision as of 08:30, 15 May 2024

scientific article
Language Label Description Also known as
English
Graph minors. IX: Disjoint crossed paths
scientific article

    Statements

    Graph minors. IX: Disjoint crossed paths (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    graph minors
    0 references
    disjoint crossed paths
    0 references

    Identifiers