COVERING AND PACKING IN GRAPHS, I.
From MaRDI portal
Publication:5632602
DOI10.1111/j.1749-6632.1970.tb56470.xzbMath0226.05119OpenAlexW2016186662MaRDI QIDQ5632602
Publication date: 1970
Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1749-6632.1970.tb56470.x
Related Items
Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings, The linear arboricity of some regular graphs, A Planar linear arboricity conjecture, LIST POINT ARBORICITY OF GRAPHS, The linear arboricity of planar graphs without 5-, 6-cycles with chords, Unnamed Item, On the linear \(k\)-arboricity of cubic graphs, Path covering problems and testing of printed circuits, Covering and packing in graphs. V. Mispacking subcubes in hypercubes, Graph factors and factorization: 1985--2003: a survey, Induced-path partition on graphs with special blocks, The linear arboricity of graphs, On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\), Unnamed Item, Edge coloring of signed graphs, The list linear arboricity of graphs, On the path partition number of 6‐regular graphs, Minimum number of disjoint linear forests covering a planar graph, Partitioning edges of a planar graph into linear forests and a matching, Orientation‐based edge‐colorings and linear arboricity of multigraphs, Three ways to cover a graph, Drawing Graphs on Few Lines and Few Planes, On the linear arboricity of graphs with treewidth at most four, Almost Every Graph can be Covered by Linear Forests, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Difference Labeling and Decomposition, Unnamed Item, The linear arboricity of planar graphs of maximum degree seven is four, Edge covering pseudo-outerplanar graphs with forests, Packing in regular graphs, Some problems about linear arboricity, Unnamed Item, Linear arboricity of digraphs, The linear arboricity of planar graphs with maximum degree at least 5, Unnamed Item, Some results on linear arboricity, New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph, Decompositions of graphs into forests with bounded maximum degree, Towards the linear arboricity conjecture, On isomorphic linear partitions in cubic graphs, The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\), Induced graphoidal decompositions in product graphs, Unnamed Item, On isomorphic linear partitions in cubic graphs, Induced label graphoidal graphs, Lict edge semientire graph of a planar graph, FURTHER RESULTS ON INDUCED GRAPHOIDAL DECOMPOSITION, An intermediate value theorem for the arboricities, On monochromatic component size for improper colourings, The biparticity of a graph, The linear arboricity of planar graphs with no short cycles, Linear arboricity of outer-1-planar graphs, The list linear arboricity of planar graphs with 7-cycles containing at most two chords, Minimum partition of an independence system into independent sets, Drawing Graphs on Few Circles and Few Spheres, Uq(sln) web models and Zn spin interfaces, Unnamed Item, On the eulericity of a graph, Unnamed Item, On linear k-arboricity, Unnamed Item, Isomorphic factorizations X: Unsolved problems, Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree, Linear \(k\)-arboricities on trees, An algorithm to Cyclic Path Covering Number, The linear arboricity of \(K_5\)-minor free graphs, Note on linear arboricity of graphs with large girth, A sequential coloring algorithm for finite sets, Interpolation theorems for graphs, hypergraphs and matroids, Factorisation of regular graphs into forests of short paths, Acyclic graphoidal covers and path partitions in a graph, Covering and packing in graphs IV: Linear arboricity, NP-completeness of some problems of partitioning and covering in graphs, THE LINEAR 6-ARBORICITY OF THE COMPLETE BIPARTITE GRAPH Km,n, Parallel concepts in graph theory, Acyclic edge-colorings of sparse graphs
