Dominating subgraphs in graphs with some forbidden structures
From MaRDI portal
(Redirected from Publication:1343259)
Recommendations
Cites work
- scientific article; zbMATH DE number 3747156 (Why is no real title available?)
- scientific article; zbMATH DE number 1247724 (Why is no real title available?)
- A characterization of graphs without long induced paths
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating cliques in graphs
- On the existence of two non-neighboring subgraphs in a graph
- The Comparability Graph of a Tree
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
Cited in
(15)- A New Characterization of P 6-Free Graphs
- Infinite versus finite graph domination
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Hull number: \(P_5\)-free graphs and reduction rules
- A new characterization of P_k-free graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Dominating cliques in \(P_ 5\)-free graphs
- Triangle-free graphs and forbidden subgraphs
- Characterization of \(P_{6}\)-free graphs
- A new characterization of \(P_{6}\)-free graphs
- On prime inductive classes of graphs
- Spectral properties of cographs and \(P_5\)-free graphs
- Decycling with a matching
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
This page was built for publication: Dominating subgraphs in graphs with some forbidden structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343259)
