Equitable list-coloring for graphs of maximum degree 3

DOI10.1002/jgt.20011zbMath1053.05051OpenAlexW4246184178MaRDI QIDQ3156919

Michael J. Pelsmajer

Publication date: 12 January 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20011

zbMATH Keywords

list coloringequitable coloringGraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (16)

Equitable d-degenerate Choosability of Graphs ⋮ Equitable coloring and equitable choosability of graphs with small maximum average degree ⋮ Equitable colorings of Kronecker products of graphs ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Equitable and equitable list colorings of graphs ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ Equitable improper choosability of graphs ⋮ Equitable list colorings of planar graphs without short cycles ⋮ On equitable and equitable list colorings of series-parallel graphs ⋮ Equitable list coloring of planar graphs without 4- and 6-cycles ⋮ Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs ⋮ A list analogue of equitable coloring ⋮ Equitable list coloring and treewidth ⋮ Equitable colorings of Cartesian products of graphs ⋮ Equitable List Coloring of Graphs with Bounded Degree ⋮ Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles

Cites Work

• Unnamed Item

This page was built for publication: Equitable list-coloring for graphs of maximum degree 3