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

DOI10.1007/BF01387754zbMath0347.05109OpenAlexW196573717MaRDI QIDQ1233877

Herbert Fleischner

Publication date: 1976

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177759

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Compatible path-cycle-decompositions of plane graphs, Flows in signed graphs with two negative edges, Short cycle covers of cubic graphs, On Perfect Matching Coverings and Even Subgraph Coverings, On the simultaneous edge coloring of graphs, A flow theory for the dichromatic number, Strong Circuit Double Cover of Some Cubic Graphs, Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden, Graphs with a 3-cycle-2-cover, Nowhere-zero 6-flows, Flows and parity subgraphs of graphs with large odd-edge-connectivity, Signed Graphs: From Modulo Flows to Integer-Valued Flows, Collapsible subgraphs of a 4-edge-connected graph, Circuit decompositions and shortest circuit coverings of hypergraphs, Transforming eulerian trails, Linear algebraic approach to an edge-coloring result, Double covers of cubic graphs with oddness 4, Even factors of graphs, Perfect matchings with restricted intersection in cubic graphs, A note on \(k\)-walks in bridgeless graphs, Flows on flow-admissible signed graphs, Covering weighted graphs by even subgraphs, Short cycle covers of graphs and nowhere-zero flows, On flows in bidirected graphs, Integer Flows and Modulo Orientations of Signed Graphs, Shortest coverings of graphs with cycles, Non-intersecting perfect matchings in cubic graphs (Extended abstract), Circular flows of nearly Eulerian graphs and vertex-splitting

Cites Work

• The importance of being Euler
• Matching, Euler tours and the Chinese postman
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item