A Note on Graph Burning of Path Forests
Fuente:
arXiv
Guardado en:
| Autores principales: | Tan, Ta Sheng, Teh, Wen Chean |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Extremal Trees With Prescribed Burning Numbers
por: Leong, Eugene Jun Tong, et al.
Publicado: (2025)
por: Leong, Eugene Jun Tong, et al.
Publicado: (2025)
Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
por: Grippo, Luciano N., et al.
Publicado: (2025)
por: Grippo, Luciano N., et al.
Publicado: (2025)
Ternary is Still Good for Parikh Matrices
por: Mercaş, Robert, et al.
Publicado: (2024)
por: Mercaş, Robert, et al.
Publicado: (2024)
The zero blocking numbers of grid graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
Zero blocking numbers of graphs with complexity results
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
Quota Trees
por: White, Tad
Publicado: (2024)
por: White, Tad
Publicado: (2024)
Reconstructing a graph from the distance matrix of its boundary
por: Cáceres, José, et al.
Publicado: (2024)
por: Cáceres, José, et al.
Publicado: (2024)
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025)
por: Lin, Hau-Yi, et al.
Publicado: (2025)
Minimal obstructions to $C_5$-coloring in hereditary graph classes
por: Goedgebeur, Jan, et al.
Publicado: (2024)
por: Goedgebeur, Jan, et al.
Publicado: (2024)
A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
por: Bousquet, Nicolas, et al.
Publicado: (2025)
por: Bousquet, Nicolas, et al.
Publicado: (2025)
Catching Rats in $H$-minor-free Graphs
por: Gorsky, Maximilian, et al.
Publicado: (2025)
por: Gorsky, Maximilian, et al.
Publicado: (2025)
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2020)
por: Furmańczyk, Hanna, et al.
Publicado: (2020)
Algorithmic releases on the spanning trees of suitable graphs
por: Imbesi, Maurizio, et al.
Publicado: (2017)
por: Imbesi, Maurizio, et al.
Publicado: (2017)
Tight complexity bounds for diagram commutativity verification
por: Malko, Artem, et al.
Publicado: (2025)
por: Malko, Artem, et al.
Publicado: (2025)
Three results towards the approximation of special maximum matchings in graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
por: Contreras-Mendoza, Fernando Esteban, et al.
Publicado: (2022)
Small-scale operations on graphic sequences
por: Rusu, Irena
Publicado: (2026)
por: Rusu, Irena
Publicado: (2026)
Improved bounds for acyclic coloring parameters
por: Kirousis, Lefteris, et al.
Publicado: (2022)
por: Kirousis, Lefteris, et al.
Publicado: (2022)
On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
por: Onofri, Elia
Publicado: (2024)
por: Onofri, Elia
Publicado: (2024)
Thick Forests
por: Dyer, Martin, et al.
Publicado: (2023)
por: Dyer, Martin, et al.
Publicado: (2023)
Perfecting the Line Graph
por: Bal, Hartosh Singh
Publicado: (2025)
por: Bal, Hartosh Singh
Publicado: (2025)
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
por: Mkrtchyan, Vahan
Publicado: (2024)
por: Mkrtchyan, Vahan
Publicado: (2024)
Solving the Graph Burning Problem for Large Graphs
por: Pereira, Felipe de Carvalho, et al.
Publicado: (2024)
por: Pereira, Felipe de Carvalho, et al.
Publicado: (2024)
Polynomial Bounds for the Graph Minor Structure Theorem
por: Gorsky, Maximilian, et al.
Publicado: (2025)
por: Gorsky, Maximilian, et al.
Publicado: (2025)
The Local Structure Theorem for Graph Minors with finite index
por: Paul, Christophe, et al.
Publicado: (2025)
por: Paul, Christophe, et al.
Publicado: (2025)
Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
por: Gollin, J. Pascal, et al.
Publicado: (2023)
por: Gollin, J. Pascal, et al.
Publicado: (2023)
Excluding Pinched Spheres
por: Morelle, Laure, et al.
Publicado: (2025)
por: Morelle, Laure, et al.
Publicado: (2025)
Paths, Ends and The Separation Problem for Infinite Graphs
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2024)
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2024)
Infinite families of planar graphs of a given injective chromatic number
por: Daneels, Matias, et al.
Publicado: (2024)
por: Daneels, Matias, et al.
Publicado: (2024)
Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser
por: Nachmanson, Lev, et al.
Publicado: (2026)
por: Nachmanson, Lev, et al.
Publicado: (2026)
The maximum number of connected sets in regular graphs
por: Cambie, Stijn, et al.
Publicado: (2023)
por: Cambie, Stijn, et al.
Publicado: (2023)
The Directed Disjoint Paths Problem with Congestion
por: Bentert, Matthias, et al.
Publicado: (2025)
por: Bentert, Matthias, et al.
Publicado: (2025)
Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
por: Oum, Sang-il, et al.
Publicado: (2026)
por: Oum, Sang-il, et al.
Publicado: (2026)
$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
por: Cervantes, Jillian, et al.
Publicado: (2024)
por: Cervantes, Jillian, et al.
Publicado: (2024)
Lower Bounds for the Pfaffian Number of Graphs
por: Junchaya, Enrique, et al.
Publicado: (2026)
por: Junchaya, Enrique, et al.
Publicado: (2026)
Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
por: Paul, Christophe, et al.
Publicado: (2024)
por: Paul, Christophe, et al.
Publicado: (2024)
Computational methods for finding bi-regular cages
por: Goedgebeur, Jan, et al.
Publicado: (2024)
por: Goedgebeur, Jan, et al.
Publicado: (2024)
Edge open packing: complexity, algorithmic aspects, and bounds
por: Brešar, Boštjan, et al.
Publicado: (2024)
por: Brešar, Boštjan, et al.
Publicado: (2024)
Polynomial $χ$-boundedness for excluding $P_5$
por: Nguyen, Tung H.
Publicado: (2025)
por: Nguyen, Tung H.
Publicado: (2025)
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
por: Zhang, Wenjing, et al.
Publicado: (2025)
por: Zhang, Wenjing, et al.
Publicado: (2025)
Ejemplares similares
-
Extremal Trees With Prescribed Burning Numbers
por: Leong, Eugene Jun Tong, et al.
Publicado: (2025) -
Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
por: Grippo, Luciano N., et al.
Publicado: (2025) -
Ternary is Still Good for Parikh Matrices
por: Mercaş, Robert, et al.
Publicado: (2024) -
The zero blocking numbers of grid graphs
por: Lin, Hau-Yi, et al.
Publicado: (2025) -
Zero blocking numbers of graphs with complexity results
por: Lin, Hau-Yi, et al.
Publicado: (2025)