Polynomially determine if a graph is \((s,3)\)-supereulerian (Q2231716)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomially determine if a graph is \((s,3)\)-supereulerian |
scientific article |
Statements
Polynomially determine if a graph is \((s,3)\)-supereulerian (English)
0 references
30 September 2021
0 references
\((s, t)\)-supereulerian graph
0 references
polynomial time algorithm
0 references
