\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.11.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067839918 / rank | |||
Normal rank | |||
Revision as of 19:25, 19 March 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
