Edge covering coloring of nearly bipartite graphs (Q854458)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5076965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge covering coloring of nearly bipartite graphs |
scientific article; zbMATH DE number 5076965 |
Statements
Edge covering coloring of nearly bipartite graphs (English)
0 references
4 December 2006
0 references
This paper presents some sufficient conditions for a nearly bipartite graph having as its edge covering chromatic number the minimum degree of vertices.
0 references
edge covering chromatic number
0 references
0.9742809
0 references
0.96676636
0 references
0 references
0 references
0.94117683
0 references
0.9330215
0 references
0 references
0.9255366
0 references
0.9187172
0 references
