The Game Saturation Number of a Graph-Reference-Cited by-同舟云学术

The Game Saturation Number of a Graph

Author:

Carraher James M.¹,Kinnersley William B.²,Reiniger Benjamin³,West Douglas B.⁴

Affiliation:

1. DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF NEBRASKA KEARNEY NEBRASKA

2. DEPARTMENT OF MATHEMATICS UNIVERSITY OF RHODE ISLAND KINGSTON RHODE ISLAND

3. MATHEMATICS DEPARTMENT RYERSON UNIVERSITY TORONTO ONTARIO CANADA

4. MATHEMATICS DEPARTMENT, ZHEJIANG NORMAL UNIVERSITY, JINHUA, ZHEJIANG, CHINA AND, MATHEMATICS DEPARTMENT UNIVERSITY OF ILLINOIS URBANA ILLINOIS

Funder

State Administration of Foreign Experts Affairs

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

Reference22 articles.

1. P.BennettandT.Bohman A note on the random greedy independent set algorithm. arXiv:1308.3732.

4. Constrained graph processes;Bollobás B.;Electron J Comb,2000

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The P5-saturation Game;Acta Mathematicae Applicatae Sinica, English Series;2024-06-01

2. Path Saturation Game on Six Vertices;Graphs and Combinatorics;2024-04-03

4. The constructor-blocker game;Applicable Analysis and Discrete Mathematics;2023

5. Linear Bounds for Cycle-Free Saturation Games;The Electronic Journal of Combinatorics;2022-07-01