Recognizing claw-free perfect graphs (Q1118619): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3222886 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transitiv orientierbare Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms on clique separable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weakly triangulated graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition of regular matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for finding clique cut-sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686753 / rank | |||
Normal rank | |||
Latest revision as of 13:53, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing claw-free perfect graphs |
scientific article |
Statements
Recognizing claw-free perfect graphs (English)
0 references
1988
0 references
A claw is a graph with vertices w,x,y,z and edges wx,wy,wz; a graph is called claw-free if none of its induced subgraphs is a claw. The paper presents an algorithm to recognize claw-free perfect graphs, which requires a polynomial time.
0 references
claw-free graph
0 references
chromatic number
0 references
perfect graphs
0 references
