05c57

Documents about 05c57

• The scramble number of outerplanar graphs#1110329arXiv (OAI Expanded)
• The burning game on graphs#1131372arXiv (All)
• Ramsey-type results for Maker-Breaker games#920507arXiv (OAI Expanded)
• Ramsey-type results for Maker-Breaker games#924741arXiv (All)
• Fast robbers on abelian Cayley graphs and digraphs#926222arXiv (All)
• On the gonality of Kneser graphs#809719arXiv (OAI Expanded)
• On the gonality of Kneser graphs#819715arXiv (All)
• Undirected edge geography games on grids#925767arXiv (All)
• The stacking number of a tree#1115767arXiv (All)
• On the Multi-Robber Damage Number#1141371arXiv (All)
• Undirected edge geography games on stacked prism graphs#998940arXiv (All)
• On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products#1142856arXiv (All)
• Burning Signed Graphs#1186820arXiv (All)
• Three-Neighbour Bootstrap Percolation in Thin Three-Dimensional Grids#1296365arXiv (All)
• Cops and robbers for hyperbolic and virtually free groups#797168arXiv (OAI Expanded)
• Cops and robbers for hyperbolic and virtually free groups#798581arXiv (All)
• Relaxed coparking functions and Stanley's conjecture for matroid $h$-vectors#1160743arXiv (OAI Expanded)
• The game chromatic number of generalized Mycielski graphs of paths and cycles#919950arXiv (OAI Expanded)
• The game chromatic number of generalized Mycielski graphs of paths and cycles#924181arXiv (All)
• Improved bounds for the lazy cops and robbers on generalized hypercubes#927470arXiv (All)
• An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408arXiv (All)
• The Game Chromatic Number of Complete Multipartite Graphs with Singletons and Large Parts#1296515arXiv (All)
• The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence#1201472arXiv (All)
• A correction to the Zero Forcing Number of the Generalized Petersen Graphs $P(n,3)$#1296459arXiv (All)
• A Complete Characterization of Convexity in Flow Games#1403071arXiv (All)
• Quantum-assisted rendezvous on hypercubes: a quantum Bernoulli noise approach#1297301arXiv (All)
• Structural and computational aspects of majority coloring games#1142104arXiv (All)
• The Almost Stacked Hypothesis: A Conjectural Analogue of Sjöstrand's Cover Pebbling Theorem#1234018arXiv (All)
• Term Coding and Dispersion: Exact and Asymptotic Decision Problems#820352arXiv (All)
• On the majority game chromatic number of forests and other graphs#1049995arXiv (All)
• Nim heaps in the Game of Cycles: the parity conjecture fails on trees#1326041arXiv (All)
• Sharp zero forcing numbers for the generalized Petersen graphs $P(n,3)$ and $P(n,4)$#1388625arXiv (All)
• Past-aware game-theoretic centrality: a framework for cardinality-constrained set-function maximization on networks#984926arXiv (All)
• Structural Parameterizations for Eternal Vertex Cover#1011606arXiv (All)
• Restricted Chip-Firing: Toric Toppling Ideals, Picard Groups, and Cellular Resolutions#919824arXiv (OAI Expanded)
• Restricted Chip-Firing: Toric Toppling Ideals, Picard Groups, and Cellular Resolutions#924053arXiv (All)
• Flow Games with Public Arcs: the Least Core and the Nucleolus#998274arXiv (All)
• Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#789552arXiv (OAI Expanded)
• Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#793556arXiv (All)