Pages that link to "Item:Q3204490"
From MaRDI portal
The following pages link to A characterization of graphs without long induced paths (Q3204490):
Displaying 20 items.
- Domination properties and induced subgraphs (Q686437) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- On \(m\)-centers in \(P_ t\)-free graphs (Q1322266) (← links)
- Dominating subgraphs in graphs with some forbidden structures (Q1343259) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- A characterization of graphs where the independence number equals the radius (Q1926039) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH (Q5696971) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
