Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127596956, #quickstatements; #temporary_batch_1721940658196 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127596956 / rank | |||
Normal rank | |||
Latest revision as of 21:55, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some completion problems for graphs without chordless cycles of prescribed lengths |
scientific article |
Statements
Some completion problems for graphs without chordless cycles of prescribed lengths (English)
0 references
19 September 2019
0 references
completion problem
0 references
sandwich problem
0 references
\(C_4\)-free graphs
0 references
\((C_4, \dots, C_s)\)-free graphs
0 references
\((C_4, C_6, \ldots, C_{2 s})\)-free graphs
0 references
0 references
0 references
