Packings and perfect path double covers of maximal planar graphs

DOI10.1016/0012-365X(93)90334-PzbMath0782.05067OpenAlexW2076749882MaRDI QIDQ686163

Karen 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

zbMATH Keywords

perfect packingmaximal planar graphperfect path double coverfacial triangles

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing subgraphs in a graph
• Parallel concepts in graph theory
• On Eulerian and regular perfect path double covers of graphs
• Perfect path double covers of graphs
• Perfect path double covers in every simple graph
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs

This page was built for publication: Packings and perfect path double covers of maximal planar graphs