A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232): 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.disc.2021.112321 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3128902974 / rank | |||
Normal rank |
Revision as of 23:14, 19 March 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