We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph.Induced, subgraph, decomposition.

Benjamin Lévêque

Frédéric Maffray

Nicolas Trotignon

English

Research Papers in Economics

Claw-free graphs. IV. Decomposition theorem.

Detecting induced subgraphs.

Graph Theory.

On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph

http://halshs.archives-ouvertes.fr/docs/00/18/09/61/PDF/B07051.pdf

On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph

Abstract

Similar works

Full text

Available Versions

Research Papers in Economics