Almost all asters are splittable

zbMATH Open1218.05152MaRDI QIDQ2995152FDOQ2995152

Authors: Gary E. Stevens 

Publication date: 20 April 2011

Recommendations

• Degree-splittability of multigraphs and caterpillars
• Some graphs for which even size is sufficient for splittability
• scientific article; zbMATH DE number 554155
• Split graphs: combinatorial species and asymptotics
• Rainbow graph splitting

zbMATH Keywords

edge coloringedge set partition\(k\)-splittableasterscollection of pathssplittable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (1)

• Some graphs for which even size is sufficient for splittability

This page was built for publication: Almost all asters are splittable

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