Matching and spanning in certain planar graphs

DOI10.1007/BF01744575MaRDI QIDQ3043190zbMATH OpenFDO

Authors J. W. Carlyle, Sheila A. Greibach, Azaria Paz

Publication date 1983

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01744575

zbMATH Keywords

greedy algorithmsmatchingsplanar graphsterminal-bounded spanning trees

Mathematics Subject Classification ID

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

Cites work

• A decomposition theorem for partially ordered sets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficient Planarity Testing
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3349867 (Why is no real title available?)
• Paths, Trees, and Flowers
• The Planar Hamiltonian Circuit Problem is NP-Complete

Cited in

(1)

• Illumination in the presence of opaque line segments in the plane

This page was built for publication: Matching and spanning in certain planar graphs

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