Infinite, highly connected digraphs with no two arc-disjoint spanning trees (Q3816091): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1002/jgt.3190130110 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073756810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:09, 19 June 2024

scientific article
Language Label Description Also known as
English
Infinite, highly connected digraphs with no two arc-disjoint spanning trees
scientific article

    Statements

    Infinite, highly connected digraphs with no two arc-disjoint spanning trees (English)
    0 references
    0 references
    0 references
    1989
    0 references
    infinite graphs
    0 references
    connectivity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references