Amenable colorings

DOI10.1016/S0166-218X(96)00127-8zbMath0947.05036OpenAlexW2914681423MaRDI QIDQ5906786

Fred S. Roberts, N. V. R. Mahadev

Publication date: 8 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(96)00127-8

zbMATH Keywords

choosabilitylist coloringgraph colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Restraints permitting the largest number of colourings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Graph coloring satisfying restraints
• List-colourings of graphs
• A new upper bound for the list chromatic number
• Colorings and orientations of graphs
• List \(T\)-colorings of graphs
• Algorithmic complexity of list colorings
• Every planar graph is 5-choosable
• The list chromatic index of a bipartite multigraph
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Colour-critical graphs and hypergraphs
• A note on list-colorings
• Some upper bounds on the total and list chromatic numbers of multigraphs