Supereulerian graphs and the Petersen graph (Q5917747): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053749941 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:30, 20 March 2024
scientific article; zbMATH DE number 839138
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Supereulerian graphs and the Petersen graph |
scientific article; zbMATH DE number 839138 |
Statements
Supereulerian graphs and the Petersen graph (English)
0 references
18 June 1996
0 references
A graph \(G\) is called supereulerian if \(G\) has a spanning closed trail. Using a reduction technique, which was developed by the first author [A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12, No. 1, 29-45 (1988; Zbl 0659.05073)], the authors prove that any 3-edge-connected graph with at most 10 edge cuts of size 3 either is a supereulerian graph or it is contractible to the Petersen graph.
0 references
supereulerian graph
0 references
contractible
0 references
Petersen graph
0 references
