On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph (Q2997586)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the existence of a cycle of length at least 7 in a (1, 2)-twin-free graph |
scientific article; zbMATH DE number 5885805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the existence of a cycle of length at least 7 in a \((1,\leq 2)\)-twin-free graph |
scientific article; zbMATH DE number 5885805 |
Statements
On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph (English)
0 references
9 May 2011
0 references
undirected graph
0 references
twin subsets
0 references
identifiable graph
0 references
distinguishable graph
0 references
identifying code
0 references
maximum length cycle
0 references
0.7657321691513062
0 references
0.7624317407608032
0 references
0.7556766867637634
0 references
0.7520508766174316
0 references
