Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3877237

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

zbMATH Open0551.05059MaRDI QIDQ3344237FDOQ3344237


Authors: Fred Buckley, Frank Harary Edit this on Wikidata


Publication date: 1984



Title of this publication is not available (Why is that?)



Recommendations

  • On Degree Achievement and Avoidance Games for Graphs
  • Bounded degree, triangle avoidance graph games
  • The domination game played on diameter 2 graphs
  • scientific article; zbMATH DE number 3900800
  • Connected, bounded degree, triangle avoidance games
  • Avoider-Enforcer games played on edge disjoint hypergraphs
  • Graph games and edge density of graphs
  • Balanced avoidance games on random graphs
  • Distance \(d\)-domination games
  • The graph distance game and some graph operations


zbMATH Keywords

diameteravoidance gameachievement game


Mathematics Subject Classification ID

2-person games (91A05) Paths and cycles (05C38) Graph theory (05C99)



Cited In (8)

  • On Degree Achievement and Avoidance Games for Graphs
  • The diameter game
  • Title not available (Why is that?)
  • On the set coincidence game
  • The set coincidence game: Complexity, attainability, and symmetric strategies
  • Impartial hypergraph games
  • On Ringeisen's isolation game. II
  • Minimum degree games for graphs





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3344237&oldid=16591921"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 14:16. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki