Connected, bounded degree, triangle avoidance games

MaRDI QIDQ640454zbMATH OpenFDO

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

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

Mathematics Subject Classification ID

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

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

Cited in

(12)

• The constructor-blocker game
• Game saturation of intersecting families
• scientific article; zbMATH DE number 3877237 (Why is no real title available?)
• The star avoidance game
• scientific article; zbMATH DE number 1735736 (Why is no real title available?)
• On strong avoiding games
• scientific article; zbMATH DE number 3845628 (Why is no real title available?)
• scientific article; zbMATH DE number 140096 (Why is no real title available?)
• 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)