A characterization of graphs without long induced paths
From MaRDI portal
Publication:3204490
DOI10.1002/jgt.3190140409zbMath0717.05044OpenAlexW2149120814MaRDI QIDQ3204490
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140409
Related Items
Dominating subgraphs in graphs with some forbidden structures, The ratio of the distance irredundance and domination numbers of a graph, Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs, Characterization of graphs dominated by induced paths, An algorithm to find two distance domination parameters in a graph, Characterization of \(P_{6}\)-free graphs, A characterization of graphs where the independence number equals the radius, Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time, Tree-Width and Optimization in Bounded Degree Graphs, Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time, Some results on maximum stable sets in certain \(P_{5}\)-free graphs, Dominating cliques in \(P_ 5\)-free graphs, GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH, Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs, Domination properties and induced subgraphs, Infinite versus finite graph domination, Complete description of forbidden subgraphs in the structural domination problem, On efficient domination for some classes of \(H\)-free bipartite graphs, Stable sets in certain \(P_6\)-free graphs, On \(m\)-centers in \(P_ t\)-free graphs
