On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (Q6611087)
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: On ( n , m )-chromatic numbers of graphs with bounded sparsity parameters |
scientific article; zbMATH DE number 7919082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters |
scientific article; zbMATH DE number 7919082 |
Statements
On \(( n , m )\)-chromatic numbers of graphs with bounded sparsity parameters (English)
0 references
26 September 2024
0 references
colored mixed graphs
0 references
graph homomorphisms
0 references
chromatic number
0 references
sparse graphs
0 references
planar graphs
0 references
partial 2-trees
0 references
0.8294764757156372
0 references
0.7897402048110962
0 references
0.7645688056945801
0 references
0.762439489364624
0 references
0.752363920211792
0 references
