Decomposing complete equipartite graphs into connected unicyclic graphs of size five

zbMATH Open1339.05313MaRDI QIDQ2811697FDOQ2811697

Ming-Hway Huang

Publication date: 10 June 2016

Published in: Utilitas Mathematica (Search for Journal in Brave)

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
• Decompositions of some regular graphs into unicyclic graphs of order five
• Decompositions of graphs into 5-cycles and other small graphs
• Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges

This page was built for publication: Decomposing complete equipartite graphs into connected unicyclic graphs of size five

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