Coloring Graphs with Constraints on Connectivity (Q4978449)
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: Coloring Graphs with Constraints on Connectivity |
scientific article; zbMATH DE number 6759338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring Graphs with Constraints on Connectivity |
scientific article; zbMATH DE number 6759338 |
Statements
Coloring Graphs with Constraints on Connectivity (English)
0 references
10 August 2017
0 references
coloring
0 references
local connectivity
0 references
local edge-connectivity
0 references
Brooks' theorem
0 references
minimally \(k\)-connected
0 references
vertex degree
0 references
0 references
0.9343914
0 references
0 references
0.9255791
0 references
0.9232814
0 references
0 references
0 references
