Claw-free graphs. II. Non-orientable prismatic graphs

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


A graph is prismatic if for every triangle T, every vertex not in T has exactly one neighbour in T. In a previous paper we gave a complete description of all 3-colourable prismatic graphs, and of a slightly more general class, the "orientable" prismatic graphs. In this paper we describe the non-orientable ones, thereby completing a description of all prismatic graphs. Since complements of prismatic graphs are claw-free, this is a step towards the main goal of this series of papers, providing a structural description of all claw-free graphs (a graph is claw-free if no vertex has three pairwise nonadjacent neighbours).

Original languageEnglish (US)
Pages (from-to)249-290
Number of pages42
JournalJournal of Combinatorial Theory. Series B
Issue number2
StatePublished - Mar 2008

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


  • Claw-free graphs
  • Induced subgraphs


Dive into the research topics of 'Claw-free graphs. II. Non-orientable prismatic graphs'. Together they form a unique fingerprint.

Cite this