arXiv (All)
open access
Burning Signed Graphs
We introduce and analyze a new model of graph burning, in which two competing fires (coloured yellow and green) ignite vertices of a given signed graph and propagate along its edges. The boolean sign of an edge determines whether a fire spreading along the edge changes colour or not. In each step, a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On several judicious partitioning problems of graphs and hypergraphs#1354484
- Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center#1077748
- Partitioning an $S$-packing coloring into broadcast dominating sets#1188155
- Domination in graphs#1332110
- Seed thresholds and degree variance in heterogeneous bootstrap percolation with growing degrees#1200071
Record · ID 1186820
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive