The Number of Linear, Directed, Rooted, and Connected Graphs (Q5849404): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
The Number of Linear, Directed, Rooted, and Connected Graphs
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.2307/1993073 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4245888957 / rank
 
Normal rank
Property / title
 
The Number of Linear, Directed, Rooted, and Connected Graphs (English)
Property / title: The Number of Linear, Directed, Rooted, and Connected Graphs (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Structures of Finite Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dissimilarity characteristic of Husimi trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dissimilarity Characteristic of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Husimi Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration of graphs in the Feynman-Dyson technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Feynman Diagrams / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:57, 11 June 2024

scientific article; zbMATH DE number 3110757
Language Label Description Also known as
English
The Number of Linear, Directed, Rooted, and Connected Graphs
scientific article; zbMATH DE number 3110757

    Statements