Weak internal partition of regular graphs

DOI10.1007/S40304-017-0114-9MaRDI QIDQ1690616zbMATH OpenOpenAlexFDO

Authors Xinkai Tao, Boyuan Liu, Xinmin Hou

Publication date 19 January 2018

Published in Communications in Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40304-017-0114-9

zbMATH Keywords

regular graphexternal partitioninternal partition

Mathematics Subject Classification ID

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

Recommendations

• Asymptotically almost every \(2r\)-regular graph has an internal partition
• Internal partitions of regular graphs
• Some results of regular graphs on the existence of balanced partition
• The Algorithmic Aspects of the Regularity Lemma
• Cycle partitions of regular graphs
• Isomorphic factorization of r-regular graphs into r parts
• Destroying noncomplete regular components in graph partitions
• Partitioning strongly regular graphs
• Graphical decompositions
• Regular factors in regular multipartite graphs

Cites work

• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• Internal partitions of regular graphs

Cited in

(3)

• Internal partitions of regular graphs
• Asymptotically almost every \(2r\)-regular graph has an internal partition
• A note on internal partitions: the 5-regular case and beyond

This page was built for publication: Weak internal partition of regular graphs

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