(Some of) the many uses of Eulerian graphs in graph theory (plus some applications) (Q5931407)
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 1591059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (Some of) the many uses of Eulerian graphs in graph theory (plus some applications) |
scientific article; zbMATH DE number 1591059 |
Statements
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications) (English)
0 references
17 January 2002
0 references
This is an excellent survey of recent results about Eulerian graphs and applications. From this survey, we can see connections between Eulerian graphs and Hamiltonian cycles, nowhere-zero flows, independent sets, colorings, cycle-coverings, etc., and the power of Eulerian graphs in solving open problems, such as the cycle-plus-triangle problem (Du-Hsu-Hwang conjecture and Erdős conjecture). In each part, some open problems and unsolved conjecture are presented.
0 references
survey
0 references
Eulerian graphas
0 references
Hamiltonian cycles
0 references
flows
0 references
cycle-plus-triangle problem
0 references
conjecture
0 references
0.7954210042953491
0 references
0.7894939184188843
0 references
0.7819831371307373
0 references
0.7712428569793701
0 references
