Edge-packing planar graphs by cyclic graphs

DOI10.1016/S0166-218X(97)00083-8zbMath0899.05043MaRDI QIDQ1382263

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

zbMATH Keywords

NP-completeplanar graphedge-packing

Mathematics Subject Classification ID

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

Related Items (1)

Packing \([1, \Delta \)-factors in graphs of small degree]

Cites Work

• Unnamed Item
• Edge-packing in planar graphs
• Edge-disjoint packings of graphs
• A structural characterization of planar combinatorial graphs
• Planar Formulae and Their Uses
• Dividing a Graph into Triconnected Components

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