On the Number of All Substructures Containing at Most Four Edges (Q5050770): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3655092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal Zagreb indices of trees with given domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matching coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipartite graphs having minimum fourth adjacency coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A certain polynomial of a graph and graphs with an extremal number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing lattice networks through substructures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5279110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Boesch's conjecture / rank
 
Normal rank

Latest revision as of 21:43, 30 July 2024

scientific article; zbMATH DE number 7619576
Language Label Description Also known as
English
On the Number of All Substructures Containing at Most Four Edges
scientific article; zbMATH DE number 7619576

    Statements