Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden

DOI10.1016/0095-8956(80)90077-5zbMath0438.05041OpenAlexW2085115560MaRDI QIDQ1141658

Herbert Fleischner

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90077-5

zbMATH Keywords

partitioncyclesEulerian graphclosed Euler tour

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Compatible path-cycle-decompositions of plane graphs, On even circuit decompositions of eulerian graphs, Isotropic systems, On semiextensions and circuit double covers, A model for finding transition-minors, Even circuits in planar graphs, Cycle covers of cubic multigraphs, Graphs with the Circuit Cover Property, Compatible Euler tours for transition systems in Eulerian graphs, A characterisation of graphs having three pariwise compatible Euler tours, On circuit decomposition of planar Eulerian graphs, Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor, Circuit decompositions of Eulerian graphs, A note on semiextensions of stable circuits, Circuit double covers in special types of cubic graphs, Circuit Double Covers of Graphs, Shortest coverings of graphs with cycles, On extremal graphs without compatible triangles or quadrilaterals

Cites Work

• Unnamed Item
• Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen