PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS

DOI10.17654/MS110010041zbMath1423.05134OpenAlexW2914837293WikidataQ128454902 ScholiaQ128454902MaRDI QIDQ5237541

Hazim Michman Trao, Niran Abbas Ali, Adem Kilicman, Gek Ling Chia

Publication date: 18 October 2019

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/ms110010041

zbMATH Keywords

partitioninggeometric graphsperfect matching

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• The book thickness of a graph
• Bounds of the number of disjoint spanning trees
• Partitions of complete geometric graphs into plane trees
• Packing trees into planar graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture

This page was built for publication: PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS