Pages that link to "Item:Q764891"

The following pages link to Equitable colorings of planar graphs with maximum degree at least nine (Q764891):

Displaying 13 items.

• The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
• Equitable vertex arboricity of graphs (Q394205) (← links)
• On equitable colorings of sparse graphs (Q726517) (← links)
• Equitable coloring and equitable choosability of graphs with small maximum average degree (Q1649917) (← links)
• Equitable coloring of three classes of 1-planar graphs (Q1753367) (← links)
• Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
• Equitable partition of planar graphs (Q2022132) (← links)
• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075) (← links)
• Equitable total-coloring of subcubic graphs (Q2341763) (← links)
• Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
• Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
• Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)