\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q123242105, #quickstatements; #temporary_batch_1712101902020 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q123242105 / rank | |||
Normal rank | |||
Revision as of 02:10, 3 April 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
