Decomposition of Finite Graphs Into Forests
From MaRDI portal
Publication:5731396
DOI10.1112/jlms/s1-39.1.12zbMath0119.38805OpenAlexW2010042187WikidataQ56390697 ScholiaQ56390697MaRDI QIDQ5731396
Publication date: 1964
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-39.1.12
Related Items (only showing first 100 items - show all)
The chromatic index of nearly bipartite multigraphs ⋮ On the first-order edge tenacity of a graph ⋮ Group connectivity of graphs with diameter at most 2 ⋮ Packing spanning trees in highly essentially connected graphs ⋮ Good and semi-strong colorings of oriented planar graphs ⋮ On the toric ideals of matroids of a fixed rank ⋮ The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Induced and weak induced arboricities ⋮ Extensions of matroid covering and packing ⋮ Trees, paths, stars, caterpillars and spiders ⋮ Facial packing edge-coloring of plane graphs ⋮ Fractional spanning tree packing, forest covering and eigenvalues ⋮ Adjacency queries in dynamic sparse graphs ⋮ Minimum-maximal matching in series-parallel graphs ⋮ Grünbaum colorings of triangulations on the projective plane ⋮ On the tree number of regular graphs ⋮ On constructive characterizations of \((k,l)\)-sparse graphs ⋮ The analysis of a nested dissection algorithm ⋮ Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) ⋮ Induced-path partition on graphs with special blocks ⋮ Efficient computation of implicit representations of sparse graphs ⋮ On the thickness and arboricity of a graph ⋮ The reduction of graph families closed under contraction ⋮ Graphs without spanning closed trails ⋮ Improved induced matchings in sparse graphs ⋮ The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests ⋮ Flows and generalized coloring theorems in graphs ⋮ On globally sparse Ramsey graphs ⋮ A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs ⋮ A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ Three ways to cover a graph ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Some inequalities for the Tutte polynomial ⋮ Supereulerian graphs in the graph family \(C_{2}(6,k)\) ⋮ Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs ⋮ Constructive characterizations for packing and covering with trees ⋮ On decomposing a hypergraph into \(k\) connected sub-hypergraphs ⋮ Combined connectivity augmentation and orientation problems ⋮ Balanced generic circuits without long paths ⋮ Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits ⋮ Facial parity edge colouring of plane pseudographs ⋮ Local and union boxicity ⋮ Minimum degree and minimum number of edge-disjoint trees ⋮ 3-uniform hypergraphs avoiding a given odd cycle ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Colouring edges with many colours in cycles ⋮ Decomposition of bounded degree graphs into \(C_4\)-free subgraphs ⋮ A linking polynomial of two matroids ⋮ On the tractability of some natural packing, covering and partitioning problems ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Two packing problems on \(k\)-matroid trees ⋮ Generalized arboricity of graphs with large girth ⋮ The degree-diameter problem for sparse graph classes ⋮ Decompositions of graphs into forests with bounded maximum degree ⋮ Facial edge ranking of plane graphs ⋮ \(H(n)\)-factors in random graphs ⋮ On the planar split thickness of graphs ⋮ Client-waiter games on complete and random graphs ⋮ Thickness and outerthickness for embedded graphs ⋮ An introduction to the discharging method via graph coloring ⋮ The coloring game on matroids ⋮ Decomposing a graph into forests and a matching ⋮ On-line list coloring of matroids ⋮ An enhancement of Nash-Williams' theorem on edge arboricity of graphs ⋮ Subtree and substar intersection numbers ⋮ On the higher-order edge toughness of a graph ⋮ Improved approximation algorithms for box contact representations ⋮ Pin-collinear body-and-pin frameworks and the molecular conjecture ⋮ Star arboricity ⋮ A note on the arboricity of graphs ⋮ Degree conditions for group connectivity ⋮ The generic rank of body-bar-and-hinge frameworks ⋮ Duality in graph families ⋮ Fractional arboricity, strength, and principal partitions in graphs and matroids ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ Bounded direction-length frameworks ⋮ Edge-disjoint spanning trees and depth-first search ⋮ An intermediate value theorem for the arboricities ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Covering planar graphs with forests ⋮ List total arboricity of 2-degenerate graphs ⋮ On maximally distant spanning trees of a graph ⋮ The tree number of a graph with a given girth ⋮ A combinatorial study of the rigidity of planar structures ⋮ Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition ⋮ On partitions of graphs into trees ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ Structural theorems for submodular functions, polymatroids and polymatroid intersections ⋮ On star and caterpillar arboricity ⋮ Rooted \(k\)-connections in digraphs ⋮ Decomposing a graph into forests ⋮ Sparsity-certifying graph decompositions ⋮ The game coloring number of planar graphs ⋮ A short proof of Nash-Williams' theorem for the arboricity of a graph ⋮ Acyclic edge-colorings of sparse graphs
This page was built for publication: Decomposition of Finite Graphs Into Forests
