Equitable colorings of \(l\)-corona products of cubic graphs

DOI10.24425/acs.2024.149658zbMATH Open1541.05059MaRDI QIDQ6577196

Hanna Furmańczyk, Marek Kubale

Publication date: 23 July 2024

Published in: Archives of Control Sciences (Search for Journal in Brave)

zbMATH Keywords

cubic graphpolynomial algorithmequitable chromatic numbercorona graph\(l\)-corona products1-absolute approximation algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable \(\Delta\)-coloring of graphs
• A fast algorithm for equitable coloring
• Equitable colorings of Cartesian products of graphs
• Equitable coloring and the maximum degree
• Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
• Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
• Structural parameterizations for equitable coloring
• Equitable colorings of corona multiproducts of graphs
• On the corona of two graphs
• Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
• Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
• Equitable Coloring
• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
• Iterated Type Partitions

This page was built for publication: Equitable colorings of \(l\)-corona products of cubic graphs