Matching and spanning in certain planar graphs

DOI10.1007/BF01744575zbMath0527.05053MaRDI QIDQ3043190

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

Publication date: 1983

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

zbMATH Keywords

planar graphsmatchingsgreedy algorithmsterminal-bounded spanning trees

Mathematics Subject Classification ID

Trees (05C05) 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)

Illumination in the presence of opaque line segments in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theorem for partially ordered sets
• Efficient Planarity Testing
• Efficiency of a Good But Not Linear Set Union Algorithm
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Paths, Trees, and Flowers
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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