Fully automorphic decompositions of graphs

zbMATH Open1271.05076MaRDI QIDQ2839731FDOQ2839731

Authors: Robert A. Beeler 

Publication date: 12 July 2013

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• Automorphic decompositions of graphs
• Chromatically supremal decompositions of graphs
• scientific article; zbMATH DE number 47528
• scientific article; zbMATH DE number 6438412
• scientific article; zbMATH DE number 1185317

zbMATH Keywords

chromatic numberintersection graphindependence numberregular graphvaluationcirculantgraceful treefully automorphic decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Cited In (2)

• Computing graph automorphism from partial solutions
• Automorphic decompositions of graphs

This page was built for publication: Fully automorphic decompositions of graphs

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