Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (Q1080863): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3682509 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The struction of a graph: Application to CN-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Some Properties of the Struction of a Graph / rank | |||
Normal rank | |||
Latest revision as of 16:03, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) |
scientific article |
Statements
Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (English)
0 references
1986
0 references
The author presents the results from his unpublished dissertation. The problem of determining the stability number in some very special classes of graphs is investigated from the complexity viewpoint. Particularly, the known polynomial-time algorithm for finding an independent set of vertices in claw-free graphs is slightly modified and further extended to a little bit complicated classes of graphs.
0 references
STRUCTION
0 references
stability number reduction
0 references
polynomial-time algorithm
0 references
claw- free graphs
0 references
