On \(f\)-colorings of nearly bipartite graphs (Q1707984)
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 f-colorings of nearly bipartite graphs |
scientific article; zbMATH DE number 6855759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(f\)-colorings of nearly bipartite graphs |
scientific article; zbMATH DE number 6855759 |
Statements
On \(f\)-colorings of nearly bipartite graphs (English)
0 references
4 April 2018
0 references
graph algorithms
0 references
nearly bipartite graph
0 references
edge coloring
0 references
\(f\)-coloring
0 references
\(f\)-chromatic index
0 references
0 references
0.9333207607269288
0 references
0.8878681063652039
0 references
0.8696921467781067
0 references
0.8578211069107056
0 references
0.856675386428833
0 references
