(Some of) the many uses of Eulerian graphs in graph theory (plus some applications)

DOI10.1016/S0012-365X(00)00067-4zbMath0977.05080MaRDI QIDQ5931407

Herbert Fleischner

Publication date: 17 January 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

surveyflowsconjecturecycle-plus-triangle problemEulerian graphasHamiltonian cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Even cycle decompositions of index 3 by a novel coloring technique ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ Computing Eulerian trails ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ Bounding the number of Eulerian tours in undirected graphs ⋮ Strongly Even-Cycle Decomposable Graphs ⋮ Refined bounds on the number of Eulerian tours in undirected graphs ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ On computing the Hamiltonian index of graphs ⋮ A counterexample to the bipartizing matching conjecture ⋮ Flows, flow-pair covers and cycle double covers

This page was built for publication: (Some of) the many uses of Eulerian graphs in graph theory (plus some applications)