Equitable cluster partition of graphs with small maximum average degree

DOI10.7151/DMGT.2564MaRDI QIDQ6950198zbMATH OpenFDO

Authors Xiaoling Liu, Lei Sun, Wei Zheng

Publication date 31 July 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2564

zbMATH Keywords

dischargingequitable cluster partitionmaximum average degree

Mathematics Subject Classification ID

Partitions of sets (05A18) Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• 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
• scientific article; zbMATH DE number 1308943 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Relaxed equitable colorings of planar graphs with girth at least 8

This page was built for publication: Equitable cluster partition of graphs with small maximum average degree

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