Cutting a graph into two dissimilar halves (Q3801597): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q105889473, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105889473 / rank | |||
Normal rank | |||
Revision as of 00:37, 28 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting a graph into two dissimilar halves |
scientific article |
Statements
Cutting a graph into two dissimilar halves (English)
0 references
1988
0 references
discrepancy
0 references
numbers of the edges
0 references
