A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs

DOI10.1016/0012-365X(93)90539-6zbMath0784.68066OpenAlexW2071801594MaRDI QIDQ1309452

Jean-Luc Fouquet

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90539-6

zbMATH Keywords

decompositionhouse graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

On graphs without \(P_ 5\) and \(\overline {P}_ 5\) ⋮ Minimal asymmetric graphs ⋮ On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs ⋮ Independent domination in finitely defined classes of graphs ⋮ Critical (\(P_5\), bull)-free graphs ⋮ Stability number of bull- and chair-free graphs revisited ⋮ On the structure and stability number of \(P_{5}\)- and co-chair-free graphs ⋮ Graphs with No Induced Five‐Vertex Path or Antipath ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ Independent sets in extensions of 2\(K_{2}\)-free graphs ⋮ Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH₆-Conjecture ⋮ On -sparse graphs and other families ⋮ The Erdös-Hajnal Conjecture-A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bull-free Berge graphs are perfect
• A tree representation for \(P_ 4\)-sparse graphs
• A Linear Recognition Algorithm for Cographs
• On brittle graphs
• The edge inducibility of graphs
• Prime Testing for the Split Decomposition of a Graph

This page was built for publication: A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs