\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110)
From MaRDI portal
!
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 6157667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture |
scientific article; zbMATH DE number 6157667 |
Statements
\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (English)
0 references
25 April 2013
0 references
\(b\)-coloring
0 references
dense vertex
0 references
tight graph
0 references
bipartite graph
0 references
0.8474263548851013
0 references
0.8131199479103088
0 references
0.8043227195739746
0 references
0.8021435737609863
0 references
0.8003213405609131
0 references
