A characterization of graphs without long induced paths

DOI10.1002/JGT.3190140409zbMATH Open0717.05044OpenAlexW2149120814MaRDI QIDQ3204490FDOQ3204490

Authors: Gábor Bacsó, Zsolt Tuza 

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

Recommendations

• Some results on graphs without long induced paths
• On \(m\)-centers in \(P_ t\)-free graphs
• Centers in path graphs
• scientific article; zbMATH DE number 786168
• Path partitions and \(P_{n}\)-free sets

zbMATH Keywords

long pathd-dominationk-center

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38)

Cited In (25)

• Domination properties and induced subgraphs
• GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
• Infinite versus finite graph domination
• On efficient domination for some classes of \(H\)-free bipartite graphs
• Pushing vertices in digraphs without long induced cycles
• Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Characterization of graphs dominated by induced paths
• Dominating cliques in \(P_ 5\)-free graphs
• Title not available (Why is that?)
• Characterization of \(P_{6}\)-free graphs
• An algorithm to find two distance domination parameters in a graph
• Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
• Stable sets in certain \(P_6\)-free graphs
• Dominating subgraphs in graphs with some forbidden structures
• A characterization of graphs where the independence number equals the radius
• Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
• On \(m\)-centers in \(P_ t\)-free graphs
• Tree-Width and Optimization in Bounded Degree Graphs
• Some results on graphs without long induced paths
• Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
• Centers in path graphs
• Long induced paths in graphs
• Some results on maximum stable sets in certain \(P_{5}\)-free graphs
• The ratio of the distance irredundance and domination numbers of a graph

This page was built for publication: A characterization of graphs without long induced paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204490)