scientific article; zbMATH DE number 2061806

MaRDI QIDQ4457555zbMATH OpenFDO

Authors Peter Horák

Publication date 25 March 2004

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)

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

Cited in

(6)

• Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
• On even circuit decompositions of eulerian graphs
• scientific article; zbMATH DE number 4091535 (Why is no real title available?)
• Cycle decompositions and constructive characterizations
• Circuit decompositions of Eulerian graphs
• Triangle-free Eulerian tours in graphs with maximum degree at most 4

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)