A note on the strength and minimum color sum of bipartite graphs (Q967294): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimal coloring and strength of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4719325 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The chromatic sum of a graph: history and recent developments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sum coloring of bipartite graphs with bounded degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of chromatic strength and chromatic edge strength / rank | |||
Normal rank | |||
Latest revision as of 19:25, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the strength and minimum color sum of bipartite graphs |
scientific article |
Statements
A note on the strength and minimum color sum of bipartite graphs (English)
0 references
28 April 2010
0 references
graph coloring
0 references
color sum
0 references
Mehrabadi's conjecture
0 references
bipartite graphs
0 references
strength of a graph
0 references
