Connected, bounded degree, triangle avoidance games

zbMATH Open1229.05210MaRDI QIDQ640454FDOQ640454

Authors: Nishali Mehta, Ákos Seress 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Bounded degree, triangle avoidance graph games
• On Hajnal's triangle-free game
• On Degree Achievement and Avoidance Games for Graphs
• scientific article; zbMATH DE number 1735736
• Minimum degree games for graphs

Mathematics Subject Classification ID

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

Cited In (12)

• The constructor-blocker game
• Game saturation of intersecting families
• Title not available (Why is that?)
• The star avoidance game
• Title not available (Why is that?)
• On strong avoiding games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounded degree, triangle avoidance graph games
• A connected version of the graph coloring game
• On Hajnal's triangle-free game
• Game matching number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640454)