Independent sets in graphs without subtrees with many leaves

DOI10.1134/S1990478916010014zbMath1349.05247OpenAlexW2315222681MaRDI QIDQ3186851

D. V. Zakharova, Vladimir E. Alekseev

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478916010014

zbMATH Keywords

graphindependent setpolynomial algorithmforbidden subtree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Bounds of the number of leaves of spanning trees
• Polynomial algorithm for finding the largest independent sets in graphs without forks
• Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent sets in graphs without subtrees with many leaves