On relating edges in graphs without cycles of length 4 (Q2447533): 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.jda.2013.09.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2147078876 / rank | |||
Normal rank | |||
Revision as of 19:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On relating edges in graphs without cycles of length 4 |
scientific article |
Statements
On relating edges in graphs without cycles of length 4 (English)
0 references
28 April 2014
0 references
well-covered graph
0 references
relating edge
0 references
Ford and Fulkerson algorithm
0 references
SAT problem
0 references
