\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q400523 |
||
| Property / author | |||
| Property / author: Gerard Jennhwa Chang / rank | |||
Revision as of 10:27, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture |
scientific article |
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
