Induced and weak induced arboricities
From MaRDI portal
Publication:1625812
DOI10.1016/j.disc.2018.10.018zbMath1400.05179arXiv1803.02152OpenAlexW2963043584WikidataQ128985866 ScholiaQ128985866MaRDI QIDQ1625812
Jonathan Rollin, Philip Dörr, Torsten Ueckerdt, Maria A. Axenovich
Publication date: 29 November 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.02152
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Injective edge coloring for graphs with small edge weight ⋮ Injective edge coloring of power graphs and necklaces ⋮ Injective edge-coloring of subcubic graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Injective edge coloring of graphs with maximum degree 5 ⋮ Unnamed Item ⋮ Complexity and algorithms for injective edge-coloring in graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Note on injective edge-coloring of graphs ⋮ Injective edge-coloring of graphs with small weight ⋮ Injective edge coloring of graphs ⋮ Injective edge chromatic index of generalized Petersen graphs ⋮ Injective edge coloring of sparse graphs with maximum degree 5
Cites Work
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- On forbidden subdivision characterizations of graph classes
- Graph minors. V. Excluding a planar graph
- Star arboricity
- On acyclic colorings of planar graphs
- Partitioning graphs of bounded tree-width
- The star arboricity of graphs
- Star arboricity of graphs
- Graph treewidth and geometric thickness parameters
- The \(k\)-strong induced arboricity of a graph
- Graph minors. II. Algorithmic aspects of tree-width
- An inequality involving the vertex arboricity and edge arboricity of a graph
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Induced and weak induced arboricities
