COVERING AND PACKING IN GRAPHS, I.

DOI10.1111/j.1749-6632.1970.tb56470.xzbMath0226.05119MaRDI QIDQ5632602

Frank Harary

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

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Isomorphic factorizations X: Unsolved problems, Almost Every Graph can be Covered by Linear Forests, Lict edge semientire graph of a planar graph, On isomorphic linear partitions in cubic graphs, On linear k-arboricity, NP-completeness of some problems of partitioning and covering in graphs, Graph factors and factorization: 1985--2003: a survey, Induced-path partition on graphs with special blocks, The linear arboricity of planar graphs with no short cycles, Covering and packing in graphs. V. Mispacking subcubes in hypercubes, The linear arboricity of graphs, Some problems about linear arboricity, Decompositions of graphs into forests with bounded maximum degree, A sequential coloring algorithm for finite sets, Parallel concepts in graph theory, Acyclic edge-colorings of sparse graphs, On the linear \(k\)-arboricity of cubic graphs, Linear \(k\)-arboricities on trees, 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, On monochromatic component size for improper colourings, Path covering problems and testing of printed circuits, Unnamed Item, The linear arboricity of planar graphs of maximum degree seven is four, Unnamed Item, The linear arboricity of some regular graphs, Unnamed Item, Linear arboricity of digraphs, Some results on linear arboricity, Unnamed Item, Unnamed Item, Unnamed Item, Covering and packing in graphs IV: Linear arboricity, The biparticity of a graph, On the eulericity of a graph