Forbidden pairs for connected even factors in supereulerian graphs (Q6115432)
From MaRDI portal
scientific article; zbMATH DE number 7711663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forbidden pairs for connected even factors in supereulerian graphs |
scientific article; zbMATH DE number 7711663 |
Statements
Forbidden pairs for connected even factors in supereulerian graphs (English)
0 references
12 July 2023
0 references
A graph is supereulerian if it has a spanning Eulerian subgraph. A connected even [2, 2\(s\)]-factor of a graph \(G\) is a connected factor with all vertices of even degree. The authors establish necessary and sufficient conditions for every connected supereulerian \(H\)-free graph \(G\) that it contains a connected even \([2, 2k]\)-factor, for a positive integer \(k\le 4\).
0 references
supereulerian graph
0 references
connected even factor
0 references
\(K_{1, s}\)-free graph
0 references
Hamiltonian
0 references
