Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Mapmaker's dilemma

From MaRDI portal
Publication:1182308
Jump to:navigation, search

DOI10.1016/0166-218X(91)90077-AzbMath0748.05055OpenAlexW2039202737MaRDI QIDQ1182308

Richard Beigel, William I. Gasarch

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90077-a


zbMATH Keywords

graph colouringgame with two players


Mathematics Subject Classification ID

2-person games (91A05) Coloring of graphs and hypergraphs (05C15)


Related Items

The Mapmaker's dilemma



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Recursive coloration of countable graphs
  • Bounded query classes and the difference hierarchy
  • The Mapmaker's dilemma
  • ``Global graph problems tend to be intractable
  • On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
  • Effective coloration
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1182308&oldid=12041652"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki