Flexibility of planar graphs without 4-cycles

MaRDI QIDQ6621243

Tomáš Masařík

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• List colourings of planar graphs
• The 4-choosability of plane graphs without 4-cycles
• Algorithmic complexity of list colorings
• Every planar graph is 5-choosable
• Smaller planar triangle-free graphs that are not 3-list-colorable
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Do triangle-free planar graphs have exponentially many 3-colorings?

Related Items (1)

Flexible list colorings: maximizing the number of requests satisfied

This page was built for publication: Flexibility of planar graphs without 4-cycles