Orientable burning number of graphs
From MaRDI portal
Publication:6575409
DOI10.1007/978-981-97-0566-5_27MaRDI QIDQ6575409FDOQ6575409
Authors: Julien Courtiel, Paul Dorbec, Tatsuya Gima, Yota Otachi 
Publication date: 19 July 2024
Cites Work
- Geometric algorithms and combinatorial optimization
- Normal hypergraphs and the perfect graph conjecture
- Fixed-parameter algorithms for cluster vertex deletion
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Easy problems for tree-decomposable graphs
- Parameterized algorithms
- Nombre chromatique et plus longs chemins d'un graphe
- On a Problem in Graph Theory
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Distances in orientations of graphs
- The monadic second-order logic of graphs. VIII: Orientations
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Title not available (Why is that?)
- Zur algebraischen Begründung der Graphentheorie. I
- Directed domination in oriented graphs
- Transmitting in the \(n\)-dimensional cube
- The complexity of two graph orientation problems
- Title not available (Why is that?)
- A greedy partition lemma for directed domination
- Minimizing and maximizing the diameter in orientations of graphs
- Über kombinatorische Eigenschaften von Matrizen.
- Graphen und Matrices.
- Burning a graph is hard
- Burning a graph as a model of social contagion
- How to Burn a Graph
- Burning number of caterpillars
- Parameterized algorithms for Graph Burning problem
- On some graph classes related to perfect graphs: a survey
- Domination and fractional domination in digraphs
- The trouble with the second quantifier
- A survey of graph burning
- The burning number of directed graphs: bounds and computational complexity
- Parameterized complexity of graph burning
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Burn and win
- APX-hardness and approximation for the \(k\)-burning number problem
- Graph burning and non-uniform \(k\)-centers for small treewidth
This page was built for publication: Orientable burning number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575409)
