scientific article; zbMATH DE number 2061806

zbMATH Open1036.05040MaRDI QIDQ4457555FDOQ4457555

Peter Horák

Publication date: 25 March 2004

Title of this publication is not available (Why is that?)

zbMATH Keywords

cycle decomposition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• Circuit decompositions of Eulerian graphs
• On even circuit decompositions of eulerian graphs
• Triangle-free Eulerian tours in graphs with maximum degree at most 4

   Recommendations

• Triangle-free Eulerian tours in graphs with maximum degree at most 4 👍 👎
• Even-cycle decompositions of graphs with no odd-\(K_4\)-minor 👍 👎
• Cycle decompositions and constructive characterizations 👍 👎
• (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs 👍 👎
• A charcterization of 4‐edge‐connected eulerian graphs 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457555)