Indirect counting trees in linear graphs (Q2557701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/0016-0032(71)90013-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089310087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating formulas for the number of trees in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The identification of an incompletely partitioned network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3248455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths, Circuits, Chains, and Cycles in Graphs: a Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5523467 / rank
 
Normal rank

Latest revision as of 11:17, 12 June 2024

scientific article
Language Label Description Also known as
English
Indirect counting trees in linear graphs
scientific article

    Statements

    Identifiers