Characterization of \(P_{6}\)-free graphs

DOI10.1016/J.DAM.2006.11.005zbMath1117.05082OpenAlexW1547200172MaRDI QIDQ881583

Cheng Zhao, Yue Jian Peng, Ji Ping Liu

Publication date: 30 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.005

zbMATH Keywords

dominating\(C_{t}\)-free graphs\(P_{t}\)-free graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

A new characterization of \(P_k\)-free graphs ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ A New Characterization of P 6-Free Graphs ⋮ Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \) ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ On indicated coloring of some classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Domination properties and induced subgraphs
• Introduction to ``Topics on Domination
• 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
• Dominating subgraphs in graphs with some forbidden structures
• On a property of the class of n-colorable graphs
• A characterization of graphs without long induced paths
• Graph Classes: A Survey
• Dominating cliques in graphs

This page was built for publication: Characterization of \(P_{6}\)-free graphs