Reducing prime graphs and recognizing circle graphs (Q1116953): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5635462 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isotropic systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphic presentations of isotropic systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of Directed Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156464 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of circle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3934405 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lectures on matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708048 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing circle graphs in polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconnaissance des graphes de cordes / rank | |||
Normal rank |
Revision as of 13:19, 19 June 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