NDLI: Planarity, Colorability, and Minor Games

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Szab, Tibor Stojakovi, Milo Krivelevich, Michael Hefetz, Dan
Copyright Year	2008
Abstract	Let m and b be positive integers, and let F be a hypergraph. In an $(m,b)$ Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vertices of F. Maker selects m vertices per move, and Breaker selects b vertices per move. The game ends when every vertex has been claimed by one of the players. Maker wins if he claims all of the vertices of some hyperedge of F; otherwise Breaker wins. An $(m,b)$ Avoider-Enforcer game F is played in a similar way. The only difference is in the determination of the winner: Avoider loses if he claims all of the vertices of some hyperedge of F; otherwise Enforcer loses. In this paper we consider the Maker-Breaker and Avoider-Enforcer versions of the planarity game, the k-colorability game, and the $K_t$-minor game.
Starting Page	194
Ending Page	212
Page Count	19
File Format	PDF
ISSN	08954801
DOI	10.1137/060654414
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	1
Volume Number	22
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2008-02-20
Access Restriction	Subscribed
Subject Keyword	Planar graphs; geometric and topological aspects of graph theory Combinatorial games graph minors graph coloring planar graph combinatorial games Coloring of graphs and hypergraphs Graph minors
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains

Equitable Coloring of Sparse Planar Graphs

Coloring Jordan Regions and Curves

The Minor Crossing Number

Third Case of the Cyclic Coloring Conjecture

Planar Graphs without 7-Cycles Are 4-Choosable

List edge and list total coloring of 1-planar graphs

Circular Coloring the Plane

Star Coloring and Acyclic Coloring of Locally Planar Graphs

Planarity, Colorability, and Minor Games

Similar Documents

Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains

Equitable Coloring of Sparse Planar Graphs

Coloring Jordan Regions and Curves

The Minor Crossing Number

Third Case of the Cyclic Coloring Conjecture

Planar Graphs without 7-Cycles Are 4-Choosable

List edge and list total coloring of 1-planar graphs

Circular Coloring the Plane

Star Coloring and Acyclic Coloring of Locally Planar Graphs

Planarity, Colorability, and Minor Games