A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232)
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: A characterization of 2-connected \ K₁ , 3 , N₃ , 1 , 1 \-free non-Hamiltonian graphs |
scientific article; zbMATH DE number 7327858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs |
scientific article; zbMATH DE number 7327858 |
Statements
A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (English)
0 references
25 March 2021
0 references
claw-free graph
0 references
Hamiltonian cycle
0 references
generalized net
0 references
closure
0 references
0.8926083445549011
0 references
0.8824163675308228
0 references
0.8657877445220947
0 references
0.845751941204071
0 references
