On the eulericity of a graph

DOI10.1002/jgt.3190020207zbMath0407.05062OpenAlexW2046197745MaRDI QIDQ4193509

No author found.

Publication date: 1978

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190020207

zbMATH Keywords

Eulerian SubgraphsEulericity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Covering Multigraphs by Simple Circuits ⋮ Improved bound on facial parity edge coloring ⋮ Flow modules and nowhere-zero flows ⋮ Odd decompositions and coverings of graphs ⋮ Graphs with the Circuit Cover Property ⋮ Circuit Double Covers of Graphs

Cites Work

• Unnamed Item
• COVERING AND PACKING IN GRAPHS, I.
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On the eulericity of a graph