The \(k\)-strong induced arboricity of a graph
From MaRDI portal
Publication:2408964
DOI10.1016/j.ejc.2017.05.010zbMath1371.05280arXiv1607.07174OpenAlexW2964088840MaRDI QIDQ2408964
Torsten Ueckerdt, Jonathan Rollin, Daniel Gonçalves, Maria A. Axenovich
Publication date: 10 October 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.07174
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on adjacent vertex distinguishing colorings of graphs
- Sparsity. Graphs, structures, and algorithms
- Characterisations and examples of graph classes with bounded expansion
- Graph minors. XX: Wagner's conjecture
- Additive coloring of planar graphs
- Graph minors. III. Planar tree-width
- On acyclic colorings of planar graphs
- A partial k-arboretum of graphs with bounded treewidth
- The thickness of graphs: A survey
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Surfaces, tree-width, clique-minors, and partitions
- Recent advances in algorithms and combinatorics
- Grad and classes with bounded expansion. I: Decompositions
- Locally identifying coloring in bounded expansion classes of graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- The point-arboricity of a graph
- Factors and factorizations of graphs—a survey
- An inequality involving the vertex arboricity and edge arboricity of a graph
- Covering and packing in graphs IV: Linear arboricity
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
- Decomposition of Finite Graphs Into Forests
This page was built for publication: The \(k\)-strong induced arboricity of a graph
