Edge-packing in planar graphs

L. S. Heath; J. P.C. Vergara

doi:10.1007/s002240000107

Edge-packing in planar graphs

L. S. Heath, J. P.C. Vergara

Department of Information Systems and Computer Science

Virginia Polytech. Inst. State Univ.

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	629-662
Number of pages	34
Journal	Theory of Computing Systems
Volume	31
Issue number	6
DOIs	https://doi.org/10.1007/s002240000107
State	Published - 1998

ASJC Scopus Subject Areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s002240000107

Cite this

@article{8862f62673a942eb8a197bf9fbcd09dd,

title = "Edge-packing in planar graphs",

author = "Heath, {L. S.} and Vergara, {J. P.C.}",

year = "1998",

doi = "10.1007/s002240000107",

language = "English",

volume = "31",

pages = "629--662",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "6",

}

TY - JOUR

T1 - Edge-packing in planar graphs

AU - Heath, L. S.

AU - Vergara, J. P.C.

PY - 1998

Y1 - 1998

UR - http://www.scopus.com/inward/record.url?scp=0032333573&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032333573&partnerID=8YFLogxK

U2 - 10.1007/s002240000107

DO - 10.1007/s002240000107

M3 - Article

AN - SCOPUS:0032333573

SN - 1432-4350

VL - 31

SP - 629

EP - 662

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 6

ER -

Edge-packing in planar graphs

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this