Edge-packing planar graphs by cyclic graphs

DOI10.1016/S0166-218X(97)00083-8zbMATH Open0899.05043MaRDI QIDQ1382263FDOQ1382263

Authors: Lenwood S. Heath, John Paul C. Vergara 

Publication date: 25 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• Edge-packing in planar graphs
• Edge-disjoint packings of graphs
• Planar packing of cycles and unicyclic graphs
• Graph packings

zbMATH Keywords

NP-completeplanar graphedge-packing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Planar Formulae and Their Uses
• Dividing a Graph into Triconnected Components
• Title not available (Why is that?)
• A structural characterization of planar combinatorial graphs
• Edge-packing in planar graphs
• Edge-disjoint packings of graphs

Cited In (4)

• Induced Packing of Odd Cycles in a Planar Graph
• Edge-disjoint packings of graphs
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Maximum packing for biconnected outerplanar graphs

This page was built for publication: Edge-packing planar graphs by cyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382263)