Equitable d-degenerate Choosability of Graphs

DOI10.1007/978-3-030-48966-3_19OpenAlexW3032369181MaRDI QIDQ5041194

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

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.09722

zbMATH Keywords

equitable choosability\(d\)-degenerate graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (3)

Equitable improper choosability of graphs ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy

Cites Work

• Unnamed Item
• A note on the equitable choosability of complete bipartite graphs
• Equitable improper choosability of graphs
• Analyzing lattice networks through substructures
• Equitable list-coloring for graphs of maximum degree 3
• A list analogue of equitable coloring
• Equitable list vertex colourability and arboricity of grids
• Equitable list point arboricity of graphs

This page was built for publication: Equitable d-degenerate Choosability of Graphs