Characterization of P₆-free graphs
From MaRDI portal
Publication:881583
DOI10.1016/J.DAM.2006.11.005zbMATH Open1117.05082OpenAlexW1547200172MaRDI QIDQ881583FDOQ881583
Authors: Cheng Zhao, Jiping Liu, Yuejian Peng
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
Recommendations
- A New Characterization of P 6-Free Graphs
- A new characterization of \(P_{6}\)-free graphs
- Total dominations in \(P_6\)-free graphs
- Critical \((P_6, \mathrm{banner})\)-free graphs
- Irredundance perfect andP6-free graphs
- A new characterization of \(P_k\)-free graphs
- A New Characterization of $$P_k$$-free Graphs
- 4-colorability of \(P_6\)-free graphs
- Four-coloring \(P_6\)-free graphs
- Pancyclic type properties of claw-free \(P_6\)-free graphs
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- Dominating cliques in \(P_ 5\)-free graphs
- Dominating subgraphs in graphs with some forbidden structures
- Introduction to ``Topics on Domination
- On a property of the class of n-colorable graphs
- A characterization of graphs without long induced paths
- Dominating cliques in graphs
- Title not available (Why is that?)
- Domination properties and induced subgraphs
- On the existence of two non-neighboring subgraphs in a graph
Cited In (10)
- A New Characterization of P 6-Free Graphs
- Irredundance perfect andP6-free graphs
- Title not available (Why is that?)
- A new characterization of \(P_k\)-free graphs
- The price of connectivity for dominating set: upper bounds and complexity
- Spectral radius of graphs forbidden \(C_7\) or \(C_6^\triangle \)
- A new characterization of \(P_{6}\)-free graphs
- Structure and recognition of graphs with no 6-wheel subdivision
- A New Characterization of $$P_k$$-free Graphs
- Classifying character degree graphs with six vertices
This page was built for publication: Characterization of \(P_{6}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881583)