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

Connected, bounded degree, triangle avoidance games

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

zbMath1229.05210MaRDI QIDQ640454

Nishali Mehta, Seress, Ákos

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p193.html



Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57)


Related Items (4)

Bounded degree, triangle avoidance graph games ⋮ A connected version of the graph coloring game ⋮ Game matching number of graphs ⋮ Game saturation of intersecting families







This page was built for publication: Connected, bounded degree, triangle avoidance games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:640454&oldid=12537976"
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 08:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki