Equitable cluster partition of planar graphs with girth at least 12

DOI10.3770/J.ISSN:2095-2651.2024.02.002MaRDI QIDQ6583580zbMATH OpenFDO

Authors Xiaoling Liu, Lei Sun, Wei Zheng

Publication date 6 August 2024

Published in Journal of Mathematical Research with Applications (Search for Journal in Brave)

zbMATH Keywords

girthplanar graphdischargingequitable cluster partition

Mathematics Subject Classification ID

Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Equitable partition of planar graphs
• Equitable coloring planar graphs with large girth
• Equitable coloring of sparse planar graphs
• Partitioning planar graphs with girth at least 6 into bounded size components
• Equitable partition of graphs into induced forests

Cites work

• scientific article; zbMATH DE number 1308943 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Equitable coloring and the maximum degree
• Equitable coloring of sparse planar graphs
• Equitable coloring planar graphs with large girth
• Equitable defective coloring of sparse planar graphs
• Graph theory with applications
• Relaxed equitable colorings of planar graphs with girth at least 8

This page was built for publication: Equitable cluster partition of planar graphs with girth at least 12

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