Graph decomposition via edge edits into a union of regular graphs

DOI10.1016/J.DISC.2025.114686MaRDI QIDQ6930278zbMATH OpenFDO

Authors Tony Zeng

Publication date 16 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114686

zbMATH Keywords

almost regular graphgraph edit distanceregular graph

Mathematics Subject Classification ID

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

Cites work

• A survey of graph edit distance
• Decomposing graphs into a constant number of locally irregular subgraphs
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of graphs into trees, forests, and regular subgraphs
• On decomposing graphs of large minimum degree into locally irregular subgraphs

This page was built for publication: Graph decomposition via edge edits into a union of regular graphs

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