Dominating subgraphs in graphs with some forbidden structures

DOI10.1016/0012-365X(93)E0111-GzbMath0812.05052MaRDI QIDQ1343259

Hui Shan Zhou, Ji Ping Liu

Publication date: 1 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

dominating setdominating subgraphforbidden structures

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (13)

Triangle-free graphs and forbidden subgraphs ⋮ Hull number: \(P_5\)-free graphs and reduction rules ⋮ Decycling with a matching ⋮ A new characterization of \(P_k\)-free graphs ⋮ Characterization of \(P_{6}\)-free graphs ⋮ On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs ⋮ Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ A New Characterization of P 6-Free Graphs ⋮ On prime inductive classes of graphs ⋮ Infinite versus finite graph domination ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ Spectral properties of cographs andP₅-free graphs ⋮ Complete description of forbidden subgraphs in the structural domination problem

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On the existence of two non-neighboring subgraphs in a graph
• Dominating cliques in \(P_ 5\)-free graphs
• A characterization of graphs without long induced paths
• The Comparability Graph of a Tree
• Dominating cliques in graphs

This page was built for publication: Dominating subgraphs in graphs with some forbidden structures