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

The positive minimum degree game on sparse graphs

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

zbMath1243.05163MaRDI QIDQ426781

András Pluhár, József Balogh

Publication date: 12 June 2012

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

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p22


zbMATH Keywords

discharging method


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Games involving graphs (91A43) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)


Related Items (2)

Maker-Breaker total domination game on cubic graphs ⋮ The toucher-isolator game







This page was built for publication: The positive minimum degree game on sparse graphs

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