A \(\sigma_3\) condition for arbitrarily partitionable graphs (Q6985911)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8038110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\sigma_3\) condition for arbitrarily partitionable graphs |
scientific article; zbMATH DE number 8038110 |
Statements
A \(\sigma_3\) condition for arbitrarily partitionable graphs (English)
0 references
12 May 2025
0 references
arbitrarily partitionable graph
0 references
partition into connected subgraphs
0 references
\( \sigma 3\) condition
0 references
Hamiltonian graph
0 references
traceable graph
0 references
