Depth-first search as a combinatorial correspondence (Q754887): 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.1016/0097-3165(79)90108-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069422812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inversion enumerator for labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration Of Labelled Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088832 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:17, 13 June 2024

scientific article
Language Label Description Also known as
English
Depth-first search as a combinatorial correspondence
scientific article

    Statements

    Depth-first search as a combinatorial correspondence (English)
    0 references
    0 references
    0 references
    1979
    0 references
    enumerator
    0 references
    graphs
    0 references
    trees
    0 references
    depth-first search
    0 references
    spanning tree
    0 references
    connected graph
    0 references
    directed graphs
    0 references
    tournaments
    0 references
    Tutte polynomial
    0 references
    spanning forests
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references