Equitable partition of graphs into independent sets and cliques

DOI10.21711/231766362021/RMC4812MaRDI QIDQ6496798zbMATH OpenFDO

Authors Bruno B. Monteiro, Vinícius F. dos Santos

Publication date 6 May 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362021/RMC4812

zbMATH Keywords

coloringgraph algorithmspartition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the complexity of local-equitable coloring of graphs
• scientific article; zbMATH DE number 3872703
• Equitable 4-coloring of cacti and edge-cacti in polynomial time
• Equitable coloring of hypergraphs
• scientific article; zbMATH DE number 3963195

Cited in

(2)

• On the complexity of local-equitable coloring of graphs
• Clique and anticlique partitions of graphs

This page was built for publication: Equitable partition of graphs into independent sets and cliques

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