Reducing prime graphs and recognizing circle graphs (Q1116953): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579301 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015381896 / rank | |||
Normal rank | |||
Latest revision as of 09:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing prime graphs and recognizing circle graphs |
scientific article |
Statements
Reducing prime graphs and recognizing circle graphs (English)
0 references
1987
0 references
A reduction theorem for prime (simple) graphs in \textit{W. H. Cunningham}'s sense [SIAM J. Algebraic Discrete Methods 3, 214-228 (1982; Zbl 0497.05031)] is presented. It says that every prime graph of order \(n>5\) contains a smaller prime graph of order n-1. As an application a polynomial algorithm for recognizing circle graphs in \((n^ 5)\) time is presented.
0 references
reduction theorem
0 references
prime graph
0 references
