A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (Q528481): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6715033 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph coloring | |||
| Property / zbMATH Keywords: graph coloring / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
fixed-parameter tractability | |||
| Property / zbMATH Keywords: fixed-parameter tractability / rank | |||
Normal rank | |||
Revision as of 07:14, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length |
scientific article |
Statements
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length (English)
0 references
12 May 2017
0 references
graph coloring
0 references
fixed-parameter tractability
0 references
