Independent sets in graphs without subtrees with many leaves (Q3186851): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of leaves of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of subcubic planar graphs for which the independent set problem is polynomially solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374992 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1990478916010014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2315222681 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
Independent sets in graphs without subtrees with many leaves
scientific article

    Statements

    Identifiers