Efficient algorithms for finding critical subgraphs (Q2467361)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for finding critical subgraphs |
scientific article; zbMATH DE number 5228815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for finding critical subgraphs |
scientific article; zbMATH DE number 5228815 |
Statements
Efficient algorithms for finding critical subgraphs (English)
0 references
21 January 2008
0 references
graph coloring
0 references
chromatic number
0 references
critical subgraphs
0 references
0 references
