Equitable improper choosability of graphs

DOI10.1016/J.TCS.2020.08.001MaRDI QIDQ2205938zbMATH OpenOpenAlexFDO

Authors Ewa Drgas-Burchardt, Hanna Furmańczyk, Elżbieta Sidorowicz

Publication date 21 October 2020

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2020.08.001

zbMATH Keywords

\(d\)-degenerate graphequitable choosabilityhereditary classes

Mathematics Subject Classification ID

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

Recommendations

• A list analogue of equitable coloring
• Equitable and equitable list colorings of graphs
• Equitable list coloring of graphs with bounded degree
• Equitable list-coloring for graphs of maximum degree 3
• On Equitable Coloring of d-Degenerate Graphs

Cites work

• A list analogue of equitable coloring
• Analyzing lattice networks through substructures
• Equitable d-degenerate Choosability of Graphs
• Equitable list point arboricity of graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable list-coloring for graphs of maximum degree 3
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)

Cited in

(8)

• Theoretical aspects of equitable partition of networks into sparse modules
• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• scientific article; zbMATH DE number 5902595 (Why is no real title available?)
• On equitable list arboricity of graphs
• Equitable d-degenerate Choosability of Graphs
• Equitable list vertex colourability and arboricity of grids
• Equitable vertex arboricity of graphs with low maximum degree

This page was built for publication: Equitable improper choosability of graphs

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