The matcher game played in graphs (Q1701097)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The matcher game played in graphs	scientific article

Statements

scholarly article

0 references

The matcher game played in graphs (English)

0 references

0 references

Michael A. Henning

0 references

Discrete Applied Mathematics

0 references

publication date

22 February 2018

0 references

zbMATH Keywords

matcher game

0 references

matching

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2017.11.038

0 references

ON THE COMPLEXITY OF SOME COLORING GAMES

0 references

Game list colouring of graphs

0 references

Domination Game and an Imagination Strategy

0 references

Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game

0 references

Bounds on the game transversal number in hypergraphs

0 references

Game matching number of graphs

0 references

Some Theorems on Abstract Graphs

0 references

Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two

0 references

The 4/5 upper bound on the game total domination number

0 references

Total Domination in Graphs

0 references

0 references

Extending matchings in graphs: A survey

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2017.11.038

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1701097

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1701097&oldid=36374607"