Packings and perfect path double covers of maximal planar graphs
From MaRDI portal
Publication:686163
DOI10.1016/0012-365X(93)90334-PzbMATH Open0782.05067OpenAlexW2076749882MaRDI QIDQ686163FDOQ686163
Authors: K. Seyffarth 
Publication date: 23 February 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90334-p
Recommendations
- scientific article; zbMATH DE number 4105008
- Maximum packings and minimum coverings of multigraphs with paths and stars
- On packing and covering numbers of graphs
- Constructions of optimal packing and covering of the complete multigraph with applications
- On perfect packings in dense graphs
- Packing and covering triangles in planar graphs
- The complete graph \(t\)-packings and \(t\)-coverings
- On Eulerian and regular perfect path double covers of graphs
- A note on packing paths in planar graphs
- Packing bipartite graphs with covers of complete bipartite graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Packing subgraphs in a graph
- Title not available (Why is that?)
- On Eulerian and regular perfect path double covers of graphs
- Perfect path double covers of graphs
- Perfect path double covers in every simple graph
Cited In (3)
This page was built for publication: Packings and perfect path double covers of maximal planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686163)
