Semi-random process without replacement

DOI10.1007/978-3-030-83823-2_21MaRDI QIDQ6604684

Shoni Gilboa, Dan Hefetz

Publication date: 13 September 2024

zbMATH Keywords

random processgames on graphs

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Colorings and orientations of graphs
• Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
• Semi‐random graph process

Related Items (2)

Cliques, chromatic number, and independent sets in the semi-random process ⋮ Subgraph games in the semi-random graph process and its generalization to hypergraphs

This page was built for publication: Semi-random process without replacement

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