A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2021.112321 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2021.112321 / rank | |||
Normal rank | |||
Latest revision as of 14:07, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs |
scientific article |
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
